251.16/191.40 251.16/191.40 Ultimate: Cannot open display: 251.16/191.40 This is Ultimate 0.1.24-8dc7c08-m 251.16/191.40 [2019-03-28 12:22:16,215 INFO L170 SettingsManager]: Resetting all preferences to default values... 251.16/191.40 [2019-03-28 12:22:16,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 251.16/191.40 [2019-03-28 12:22:16,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 251.16/191.40 [2019-03-28 12:22:16,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 251.16/191.40 [2019-03-28 12:22:16,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 251.16/191.40 [2019-03-28 12:22:16,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 251.16/191.40 [2019-03-28 12:22:16,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 251.16/191.40 [2019-03-28 12:22:16,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 251.16/191.40 [2019-03-28 12:22:16,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 251.16/191.40 [2019-03-28 12:22:16,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 251.16/191.40 [2019-03-28 12:22:16,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 251.16/191.40 [2019-03-28 12:22:16,236 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 251.16/191.40 [2019-03-28 12:22:16,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 251.16/191.40 [2019-03-28 12:22:16,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 251.16/191.40 [2019-03-28 12:22:16,239 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 251.16/191.40 [2019-03-28 12:22:16,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 251.16/191.40 [2019-03-28 12:22:16,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 251.16/191.40 [2019-03-28 12:22:16,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 251.16/191.40 [2019-03-28 12:22:16,245 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 251.16/191.40 [2019-03-28 12:22:16,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 251.16/191.40 [2019-03-28 12:22:16,247 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 251.16/191.40 [2019-03-28 12:22:16,249 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 251.16/191.40 [2019-03-28 12:22:16,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 251.16/191.40 [2019-03-28 12:22:16,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 251.16/191.40 [2019-03-28 12:22:16,251 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 251.16/191.40 [2019-03-28 12:22:16,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 251.16/191.40 [2019-03-28 12:22:16,252 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 251.16/191.40 [2019-03-28 12:22:16,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 251.16/191.40 [2019-03-28 12:22:16,253 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 251.16/191.40 [2019-03-28 12:22:16,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 251.16/191.40 [2019-03-28 12:22:16,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 251.16/191.40 [2019-03-28 12:22:16,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 251.16/191.40 [2019-03-28 12:22:16,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 251.16/191.40 [2019-03-28 12:22:16,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 251.16/191.40 [2019-03-28 12:22:16,256 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 251.16/191.40 [2019-03-28 12:22:16,257 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 251.16/191.40 [2019-03-28 12:22:16,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 251.16/191.40 [2019-03-28 12:22:16,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 251.16/191.40 [2019-03-28 12:22:16,259 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 251.16/191.40 [2019-03-28 12:22:16,273 INFO L110 SettingsManager]: Loading preferences was successful 251.16/191.40 [2019-03-28 12:22:16,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 251.16/191.40 [2019-03-28 12:22:16,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 251.16/191.40 [2019-03-28 12:22:16,275 INFO L133 SettingsManager]: * Rewrite not-equals=true 251.16/191.40 [2019-03-28 12:22:16,275 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 251.16/191.40 [2019-03-28 12:22:16,275 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 251.16/191.40 [2019-03-28 12:22:16,275 INFO L133 SettingsManager]: * Use SBE=true 251.16/191.40 [2019-03-28 12:22:16,275 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 251.16/191.40 [2019-03-28 12:22:16,275 INFO L133 SettingsManager]: * Use old map elimination=false 251.16/191.40 [2019-03-28 12:22:16,276 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 251.16/191.40 [2019-03-28 12:22:16,276 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 251.16/191.40 [2019-03-28 12:22:16,276 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 251.16/191.40 [2019-03-28 12:22:16,276 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 251.16/191.40 [2019-03-28 12:22:16,276 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 251.16/191.40 [2019-03-28 12:22:16,276 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 251.16/191.40 [2019-03-28 12:22:16,277 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 251.16/191.40 [2019-03-28 12:22:16,277 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 251.16/191.40 [2019-03-28 12:22:16,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE 251.16/191.40 [2019-03-28 12:22:16,277 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 251.16/191.40 [2019-03-28 12:22:16,277 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 251.16/191.40 [2019-03-28 12:22:16,278 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 251.16/191.40 [2019-03-28 12:22:16,278 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 251.16/191.40 [2019-03-28 12:22:16,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 251.16/191.40 [2019-03-28 12:22:16,278 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 251.16/191.40 [2019-03-28 12:22:16,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 251.16/191.40 [2019-03-28 12:22:16,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 251.16/191.40 [2019-03-28 12:22:16,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 251.16/191.40 [2019-03-28 12:22:16,279 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 251.16/191.40 [2019-03-28 12:22:16,279 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 251.16/191.40 [2019-03-28 12:22:16,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 251.16/191.40 [2019-03-28 12:22:16,318 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 251.16/191.40 [2019-03-28 12:22:16,321 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 251.16/191.40 [2019-03-28 12:22:16,323 INFO L271 PluginConnector]: Initializing CDTParser... 251.16/191.40 [2019-03-28 12:22:16,323 INFO L276 PluginConnector]: CDTParser initialized 251.16/191.40 [2019-03-28 12:22:16,324 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 251.16/191.40 [2019-03-28 12:22:16,396 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/03d9a7b21403465cac8010e79c1ba5ad/FLAG859aa88d3 251.16/191.40 [2019-03-28 12:22:16,788 INFO L307 CDTParser]: Found 1 translation units. 251.16/191.40 [2019-03-28 12:22:16,789 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 251.16/191.40 [2019-03-28 12:22:16,810 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/03d9a7b21403465cac8010e79c1ba5ad/FLAG859aa88d3 251.16/191.40 [2019-03-28 12:22:17,159 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/03d9a7b21403465cac8010e79c1ba5ad 251.16/191.40 [2019-03-28 12:22:17,170 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 251.16/191.40 [2019-03-28 12:22:17,172 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 251.16/191.40 [2019-03-28 12:22:17,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 251.16/191.40 [2019-03-28 12:22:17,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 251.16/191.40 [2019-03-28 12:22:17,177 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 251.16/191.40 [2019-03-28 12:22:17,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8529be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17, skipping insertion in model container 251.16/191.40 [2019-03-28 12:22:17,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 251.16/191.40 [2019-03-28 12:22:17,229 INFO L176 MainTranslator]: Built tables and reachable declarations 251.16/191.40 [2019-03-28 12:22:17,564 INFO L206 PostProcessor]: Analyzing one entry point: main 251.16/191.40 [2019-03-28 12:22:17,577 INFO L191 MainTranslator]: Completed pre-run 251.16/191.40 [2019-03-28 12:22:17,625 INFO L206 PostProcessor]: Analyzing one entry point: main 251.16/191.40 [2019-03-28 12:22:17,668 INFO L195 MainTranslator]: Completed translation 251.16/191.40 [2019-03-28 12:22:17,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17 WrapperNode 251.16/191.40 [2019-03-28 12:22:17,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 251.16/191.40 [2019-03-28 12:22:17,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 251.16/191.40 [2019-03-28 12:22:17,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 251.16/191.40 [2019-03-28 12:22:17,670 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 251.16/191.40 [2019-03-28 12:22:17,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 251.16/191.40 [2019-03-28 12:22:17,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 251.16/191.40 [2019-03-28 12:22:17,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 251.16/191.40 [2019-03-28 12:22:17,723 INFO L276 PluginConnector]: Boogie Preprocessor initialized 251.16/191.40 [2019-03-28 12:22:17,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 [2019-03-28 12:22:17,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 251.16/191.40 [2019-03-28 12:22:17,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 251.16/191.40 [2019-03-28 12:22:17,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... 251.16/191.40 [2019-03-28 12:22:17,755 INFO L276 PluginConnector]: RCFGBuilder initialized 251.16/191.40 [2019-03-28 12:22:17,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 251.16/191.40 [2019-03-28 12:22:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 251.16/191.40 [2019-03-28 12:22:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 251.16/191.40 [2019-03-28 12:22:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap 251.16/191.40 [2019-03-28 12:22:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ 251.16/191.40 [2019-03-28 12:22:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ 251.16/191.40 [2019-03-28 12:22:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 251.16/191.40 [2019-03-28 12:22:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 251.16/191.40 [2019-03-28 12:22:18,176 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 251.16/191.40 [2019-03-28 12:22:18,176 INFO L286 CfgBuilder]: Removed 14 assue(true) statements. 251.16/191.40 [2019-03-28 12:22:18,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:22:18 BoogieIcfgContainer 251.16/191.40 [2019-03-28 12:22:18,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 251.16/191.40 [2019-03-28 12:22:18,178 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 251.16/191.40 [2019-03-28 12:22:18,178 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 251.16/191.40 [2019-03-28 12:22:18,181 INFO L276 PluginConnector]: BlockEncodingV2 initialized 251.16/191.40 [2019-03-28 12:22:18,181 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:22:18" (1/1) ... 251.16/191.40 [2019-03-28 12:22:18,200 INFO L313 BlockEncoder]: Initial Icfg 62 locations, 73 edges 251.16/191.40 [2019-03-28 12:22:18,201 INFO L258 BlockEncoder]: Using Remove infeasible edges 251.16/191.40 [2019-03-28 12:22:18,202 INFO L263 BlockEncoder]: Using Maximize final states 251.16/191.40 [2019-03-28 12:22:18,203 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 251.16/191.40 [2019-03-28 12:22:18,203 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 251.16/191.40 [2019-03-28 12:22:18,205 INFO L296 BlockEncoder]: Using Remove sink states 251.16/191.40 [2019-03-28 12:22:18,206 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 251.16/191.40 [2019-03-28 12:22:18,206 INFO L179 BlockEncoder]: Using Rewrite not-equals 251.16/191.40 [2019-03-28 12:22:18,234 INFO L185 BlockEncoder]: Using Use SBE 251.16/191.40 [2019-03-28 12:22:18,268 INFO L200 BlockEncoder]: SBE split 35 edges 251.16/191.40 [2019-03-28 12:22:18,274 INFO L70 emoveInfeasibleEdges]: Removed 5 edges and 0 locations because of local infeasibility 251.16/191.40 [2019-03-28 12:22:18,276 INFO L71 MaximizeFinalStates]: 0 new accepting states 251.16/191.40 [2019-03-28 12:22:18,304 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 251.16/191.40 [2019-03-28 12:22:18,307 INFO L70 RemoveSinkStates]: Removed 4 edges and 3 locations by removing sink states 251.16/191.40 [2019-03-28 12:22:18,308 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 251.16/191.40 [2019-03-28 12:22:18,309 INFO L71 MaximizeFinalStates]: 0 new accepting states 251.16/191.40 [2019-03-28 12:22:18,309 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 251.16/191.40 [2019-03-28 12:22:18,310 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 251.16/191.40 [2019-03-28 12:22:18,310 INFO L313 BlockEncoder]: Encoded RCFG 51 locations, 97 edges 251.16/191.40 [2019-03-28 12:22:18,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:22:18 BasicIcfg 251.16/191.40 [2019-03-28 12:22:18,311 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 251.16/191.40 [2019-03-28 12:22:18,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 251.16/191.40 [2019-03-28 12:22:18,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... 251.16/191.40 [2019-03-28 12:22:18,315 INFO L276 PluginConnector]: TraceAbstraction initialized 251.16/191.40 [2019-03-28 12:22:18,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:22:17" (1/4) ... 251.16/191.40 [2019-03-28 12:22:18,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe95877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:22:18, skipping insertion in model container 251.16/191.40 [2019-03-28 12:22:18,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (2/4) ... 251.16/191.40 [2019-03-28 12:22:18,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe95877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:22:18, skipping insertion in model container 251.16/191.40 [2019-03-28 12:22:18,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:22:18" (3/4) ... 251.16/191.40 [2019-03-28 12:22:18,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe95877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:22:18, skipping insertion in model container 251.16/191.40 [2019-03-28 12:22:18,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:22:18" (4/4) ... 251.16/191.40 [2019-03-28 12:22:18,319 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 251.16/191.40 [2019-03-28 12:22:18,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 251.16/191.40 [2019-03-28 12:22:18,337 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. 251.16/191.40 [2019-03-28 12:22:18,354 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. 251.16/191.40 [2019-03-28 12:22:18,384 INFO L133 ementStrategyFactory]: Using default assertion order modulation 251.16/191.40 [2019-03-28 12:22:18,384 INFO L382 AbstractCegarLoop]: Interprodecural is true 251.16/191.40 [2019-03-28 12:22:18,385 INFO L383 AbstractCegarLoop]: Hoare is true 251.16/191.40 [2019-03-28 12:22:18,385 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 251.16/191.40 [2019-03-28 12:22:18,385 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 251.16/191.40 [2019-03-28 12:22:18,385 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 251.16/191.40 [2019-03-28 12:22:18,385 INFO L387 AbstractCegarLoop]: Difference is false 251.16/191.40 [2019-03-28 12:22:18,385 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 251.16/191.40 [2019-03-28 12:22:18,386 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 251.16/191.40 [2019-03-28 12:22:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. 251.16/191.40 [2019-03-28 12:22:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 251.16/191.40 [2019-03-28 12:22:18,408 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:18,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:18,409 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1170389712, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:18,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:18,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:18,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:18,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:18,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 251.16/191.40 [2019-03-28 12:22:18,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 251.16/191.40 [2019-03-28 12:22:18,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 251.16/191.40 [2019-03-28 12:22:18,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 251.16/191.40 [2019-03-28 12:22:18,608 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 4 states. 251.16/191.40 [2019-03-28 12:22:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:18,921 INFO L93 Difference]: Finished difference Result 68 states and 128 transitions. 251.16/191.40 [2019-03-28 12:22:18,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 251.16/191.40 [2019-03-28 12:22:18,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 251.16/191.40 [2019-03-28 12:22:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:18,937 INFO L225 Difference]: With dead ends: 68 251.16/191.40 [2019-03-28 12:22:18,937 INFO L226 Difference]: Without dead ends: 53 251.16/191.40 [2019-03-28 12:22:18,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 251.16/191.40 [2019-03-28 12:22:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. 251.16/191.40 [2019-03-28 12:22:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. 251.16/191.40 [2019-03-28 12:22:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 251.16/191.40 [2019-03-28 12:22:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. 251.16/191.40 [2019-03-28 12:22:18,984 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 6 251.16/191.40 [2019-03-28 12:22:18,985 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:18,985 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. 251.16/191.40 [2019-03-28 12:22:18,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 251.16/191.40 [2019-03-28 12:22:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. 251.16/191.40 [2019-03-28 12:22:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 251.16/191.40 [2019-03-28 12:22:18,986 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:18,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:18,986 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1170389714, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:18,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:18,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:18,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:19,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:19,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 251.16/191.40 [2019-03-28 12:22:19,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 251.16/191.40 [2019-03-28 12:22:19,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 251.16/191.40 [2019-03-28 12:22:19,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 251.16/191.40 [2019-03-28 12:22:19,017 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 4 states. 251.16/191.40 [2019-03-28 12:22:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:19,248 INFO L93 Difference]: Finished difference Result 119 states and 230 transitions. 251.16/191.40 [2019-03-28 12:22:19,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 251.16/191.40 [2019-03-28 12:22:19,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 251.16/191.40 [2019-03-28 12:22:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:19,250 INFO L225 Difference]: With dead ends: 119 251.16/191.40 [2019-03-28 12:22:19,251 INFO L226 Difference]: Without dead ends: 74 251.16/191.40 [2019-03-28 12:22:19,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 251.16/191.40 [2019-03-28 12:22:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. 251.16/191.40 [2019-03-28 12:22:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. 251.16/191.40 [2019-03-28 12:22:19,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 251.16/191.40 [2019-03-28 12:22:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 125 transitions. 251.16/191.40 [2019-03-28 12:22:19,261 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 125 transitions. Word has length 6 251.16/191.40 [2019-03-28 12:22:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:19,262 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 125 transitions. 251.16/191.40 [2019-03-28 12:22:19,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 251.16/191.40 [2019-03-28 12:22:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 125 transitions. 251.16/191.40 [2019-03-28 12:22:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 251.16/191.40 [2019-03-28 12:22:19,263 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:19,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:19,263 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1170389715, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:19,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:19,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:19,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:19,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:19,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:19,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:19,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 251.16/191.40 [2019-03-28 12:22:19,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 251.16/191.40 [2019-03-28 12:22:19,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 251.16/191.40 [2019-03-28 12:22:19,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 251.16/191.40 [2019-03-28 12:22:19,311 INFO L87 Difference]: Start difference. First operand 62 states and 125 transitions. Second operand 4 states. 251.16/191.40 [2019-03-28 12:22:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:19,539 INFO L93 Difference]: Finished difference Result 74 states and 125 transitions. 251.16/191.40 [2019-03-28 12:22:19,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 251.16/191.40 [2019-03-28 12:22:19,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 251.16/191.40 [2019-03-28 12:22:19,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:19,541 INFO L225 Difference]: With dead ends: 74 251.16/191.40 [2019-03-28 12:22:19,541 INFO L226 Difference]: Without dead ends: 61 251.16/191.40 [2019-03-28 12:22:19,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 251.16/191.40 [2019-03-28 12:22:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. 251.16/191.40 [2019-03-28 12:22:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. 251.16/191.40 [2019-03-28 12:22:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. 251.16/191.40 [2019-03-28 12:22:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 111 transitions. 251.16/191.40 [2019-03-28 12:22:19,550 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 111 transitions. Word has length 6 251.16/191.40 [2019-03-28 12:22:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:19,550 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 111 transitions. 251.16/191.40 [2019-03-28 12:22:19,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 251.16/191.40 [2019-03-28 12:22:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 111 transitions. 251.16/191.40 [2019-03-28 12:22:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 251.16/191.40 [2019-03-28 12:22:19,551 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:19,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:19,551 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1720998587, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:19,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:19,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:19,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:19,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:19,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 251.16/191.40 [2019-03-28 12:22:19,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 251.16/191.40 [2019-03-28 12:22:19,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 251.16/191.40 [2019-03-28 12:22:19,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 251.16/191.40 [2019-03-28 12:22:19,603 INFO L87 Difference]: Start difference. First operand 61 states and 111 transitions. Second operand 5 states. 251.16/191.40 [2019-03-28 12:22:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:19,856 INFO L93 Difference]: Finished difference Result 85 states and 149 transitions. 251.16/191.40 [2019-03-28 12:22:19,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 251.16/191.40 [2019-03-28 12:22:19,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 251.16/191.40 [2019-03-28 12:22:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:19,858 INFO L225 Difference]: With dead ends: 85 251.16/191.40 [2019-03-28 12:22:19,858 INFO L226 Difference]: Without dead ends: 66 251.16/191.40 [2019-03-28 12:22:19,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 251.16/191.40 [2019-03-28 12:22:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. 251.16/191.40 [2019-03-28 12:22:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. 251.16/191.40 [2019-03-28 12:22:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. 251.16/191.40 [2019-03-28 12:22:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 113 transitions. 251.16/191.40 [2019-03-28 12:22:19,866 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 113 transitions. Word has length 11 251.16/191.40 [2019-03-28 12:22:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:19,866 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 113 transitions. 251.16/191.40 [2019-03-28 12:22:19,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 251.16/191.40 [2019-03-28 12:22:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 113 transitions. 251.16/191.40 [2019-03-28 12:22:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 251.16/191.40 [2019-03-28 12:22:19,867 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:19,867 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:19,868 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:19,868 INFO L82 PathProgramCache]: Analyzing trace with hash 494705892, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:19,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:19,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:19,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:19,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:19,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:19,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:19,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 251.16/191.40 [2019-03-28 12:22:19,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 251.16/191.40 [2019-03-28 12:22:19,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 251.16/191.40 [2019-03-28 12:22:19,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 251.16/191.40 [2019-03-28 12:22:19,916 INFO L87 Difference]: Start difference. First operand 63 states and 113 transitions. Second operand 3 states. 251.16/191.40 [2019-03-28 12:22:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:20,033 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. 251.16/191.40 [2019-03-28 12:22:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 251.16/191.40 [2019-03-28 12:22:20,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 251.16/191.40 [2019-03-28 12:22:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:20,035 INFO L225 Difference]: With dead ends: 122 251.16/191.40 [2019-03-28 12:22:20,035 INFO L226 Difference]: Without dead ends: 74 251.16/191.40 [2019-03-28 12:22:20,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 251.16/191.40 [2019-03-28 12:22:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. 251.16/191.40 [2019-03-28 12:22:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. 251.16/191.40 [2019-03-28 12:22:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. 251.16/191.40 [2019-03-28 12:22:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 105 transitions. 251.16/191.40 [2019-03-28 12:22:20,042 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 105 transitions. Word has length 12 251.16/191.40 [2019-03-28 12:22:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:20,043 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 105 transitions. 251.16/191.40 [2019-03-28 12:22:20,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 251.16/191.40 [2019-03-28 12:22:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 105 transitions. 251.16/191.40 [2019-03-28 12:22:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 251.16/191.40 [2019-03-28 12:22:20,044 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:20,044 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:20,044 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:20,044 INFO L82 PathProgramCache]: Analyzing trace with hash 496552934, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:20,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:20,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:20,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:20,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:20,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 251.16/191.40 [2019-03-28 12:22:20,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 251.16/191.40 [2019-03-28 12:22:20,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 251.16/191.40 [2019-03-28 12:22:20,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 251.16/191.40 [2019-03-28 12:22:20,094 INFO L87 Difference]: Start difference. First operand 63 states and 105 transitions. Second operand 5 states. 251.16/191.40 [2019-03-28 12:22:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:20,302 INFO L93 Difference]: Finished difference Result 75 states and 121 transitions. 251.16/191.40 [2019-03-28 12:22:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 251.16/191.40 [2019-03-28 12:22:20,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 251.16/191.40 [2019-03-28 12:22:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:20,304 INFO L225 Difference]: With dead ends: 75 251.16/191.40 [2019-03-28 12:22:20,304 INFO L226 Difference]: Without dead ends: 72 251.16/191.40 [2019-03-28 12:22:20,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 251.16/191.40 [2019-03-28 12:22:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. 251.16/191.40 [2019-03-28 12:22:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. 251.16/191.40 [2019-03-28 12:22:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 251.16/191.40 [2019-03-28 12:22:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 99 transitions. 251.16/191.40 [2019-03-28 12:22:20,310 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 99 transitions. Word has length 12 251.16/191.40 [2019-03-28 12:22:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:20,311 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 99 transitions. 251.16/191.40 [2019-03-28 12:22:20,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 251.16/191.40 [2019-03-28 12:22:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 99 transitions. 251.16/191.40 [2019-03-28 12:22:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 251.16/191.40 [2019-03-28 12:22:20,312 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:20,312 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:20,312 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:20,312 INFO L82 PathProgramCache]: Analyzing trace with hash 496552936, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:20,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:20,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:20,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:20,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:20,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 251.16/191.40 [2019-03-28 12:22:20,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 251.16/191.40 [2019-03-28 12:22:20,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 251.16/191.40 [2019-03-28 12:22:20,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 251.16/191.40 [2019-03-28 12:22:20,356 INFO L87 Difference]: Start difference. First operand 60 states and 99 transitions. Second operand 5 states. 251.16/191.40 [2019-03-28 12:22:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:20,596 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. 251.16/191.40 [2019-03-28 12:22:20,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 251.16/191.40 [2019-03-28 12:22:20,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 251.16/191.40 [2019-03-28 12:22:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:20,597 INFO L225 Difference]: With dead ends: 78 251.16/191.40 [2019-03-28 12:22:20,597 INFO L226 Difference]: Without dead ends: 71 251.16/191.40 [2019-03-28 12:22:20,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 251.16/191.40 [2019-03-28 12:22:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. 251.16/191.40 [2019-03-28 12:22:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. 251.16/191.40 [2019-03-28 12:22:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 251.16/191.40 [2019-03-28 12:22:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. 251.16/191.40 [2019-03-28 12:22:20,604 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 12 251.16/191.40 [2019-03-28 12:22:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:20,604 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. 251.16/191.40 [2019-03-28 12:22:20,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 251.16/191.40 [2019-03-28 12:22:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. 251.16/191.40 [2019-03-28 12:22:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 251.16/191.40 [2019-03-28 12:22:20,605 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:20,605 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:20,605 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash 496552937, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:20,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:20,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:20,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:20,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 251.16/191.40 [2019-03-28 12:22:20,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 251.16/191.40 [2019-03-28 12:22:20,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 251.16/191.40 [2019-03-28 12:22:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 251.16/191.40 [2019-03-28 12:22:20,670 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand 5 states. 251.16/191.40 [2019-03-28 12:22:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:20,947 INFO L93 Difference]: Finished difference Result 71 states and 108 transitions. 251.16/191.40 [2019-03-28 12:22:20,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 251.16/191.40 [2019-03-28 12:22:20,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 251.16/191.40 [2019-03-28 12:22:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:20,948 INFO L225 Difference]: With dead ends: 71 251.16/191.40 [2019-03-28 12:22:20,949 INFO L226 Difference]: Without dead ends: 64 251.16/191.40 [2019-03-28 12:22:20,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 251.16/191.40 [2019-03-28 12:22:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. 251.16/191.40 [2019-03-28 12:22:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. 251.16/191.40 [2019-03-28 12:22:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 251.16/191.40 [2019-03-28 12:22:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 71 transitions. 251.16/191.40 [2019-03-28 12:22:20,954 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 71 transitions. Word has length 12 251.16/191.40 [2019-03-28 12:22:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:20,954 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 71 transitions. 251.16/191.40 [2019-03-28 12:22:20,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 251.16/191.40 [2019-03-28 12:22:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 71 transitions. 251.16/191.40 [2019-03-28 12:22:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 251.16/191.40 [2019-03-28 12:22:20,955 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:20,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:20,955 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash -196903919, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:20,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:20,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:20,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:21,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:21,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 251.16/191.40 [2019-03-28 12:22:21,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 251.16/191.40 [2019-03-28 12:22:21,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 251.16/191.40 [2019-03-28 12:22:21,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 251.16/191.40 [2019-03-28 12:22:21,037 INFO L87 Difference]: Start difference. First operand 43 states and 71 transitions. Second operand 7 states. 251.16/191.40 [2019-03-28 12:22:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:21,274 INFO L93 Difference]: Finished difference Result 64 states and 101 transitions. 251.16/191.40 [2019-03-28 12:22:21,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 251.16/191.40 [2019-03-28 12:22:21,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 251.16/191.40 [2019-03-28 12:22:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:21,275 INFO L225 Difference]: With dead ends: 64 251.16/191.40 [2019-03-28 12:22:21,275 INFO L226 Difference]: Without dead ends: 50 251.16/191.40 [2019-03-28 12:22:21,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 251.16/191.40 [2019-03-28 12:22:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. 251.16/191.40 [2019-03-28 12:22:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. 251.16/191.40 [2019-03-28 12:22:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 251.16/191.40 [2019-03-28 12:22:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 67 transitions. 251.16/191.40 [2019-03-28 12:22:21,280 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 67 transitions. Word has length 13 251.16/191.40 [2019-03-28 12:22:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:21,280 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 67 transitions. 251.16/191.40 [2019-03-28 12:22:21,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 251.16/191.40 [2019-03-28 12:22:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 67 transitions. 251.16/191.40 [2019-03-28 12:22:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 251.16/191.40 [2019-03-28 12:22:21,281 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:21,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:21,281 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:21,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:21,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1598214639, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:21,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:21,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:21,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:21,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:21,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:21,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:21,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 21 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:21,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:21,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:21,610 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:21,621 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:21,622 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:21,623 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 251.16/191.40 [2019-03-28 12:22:21,677 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:21,678 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:21,693 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:21,694 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:21,694 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 251.16/191.40 [2019-03-28 12:22:21,772 INFO L340 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size 251.16/191.40 [2019-03-28 12:22:21,773 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 251.16/191.40 [2019-03-28 12:22:21,778 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:21,806 INFO L497 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size 251.16/191.40 [2019-03-28 12:22:21,807 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:21,808 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:30 251.16/191.40 [2019-03-28 12:22:21,875 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:21,877 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 251.16/191.40 [2019-03-28 12:22:21,877 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:21,888 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:21,889 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:21,889 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:9 251.16/191.40 [2019-03-28 12:22:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:21,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:21,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 251.16/191.40 [2019-03-28 12:22:21,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 251.16/191.40 [2019-03-28 12:22:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 251.16/191.40 [2019-03-28 12:22:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 251.16/191.40 [2019-03-28 12:22:21,946 INFO L87 Difference]: Start difference. First operand 40 states and 67 transitions. Second operand 19 states. 251.16/191.40 [2019-03-28 12:22:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:23,266 INFO L93 Difference]: Finished difference Result 192 states and 318 transitions. 251.16/191.40 [2019-03-28 12:22:23,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 251.16/191.40 [2019-03-28 12:22:23,267 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 251.16/191.40 [2019-03-28 12:22:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:23,268 INFO L225 Difference]: With dead ends: 192 251.16/191.40 [2019-03-28 12:22:23,269 INFO L226 Difference]: Without dead ends: 155 251.16/191.40 [2019-03-28 12:22:23,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 251.16/191.40 [2019-03-28 12:22:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. 251.16/191.40 [2019-03-28 12:22:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 66. 251.16/191.40 [2019-03-28 12:22:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. 251.16/191.40 [2019-03-28 12:22:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 108 transitions. 251.16/191.40 [2019-03-28 12:22:23,278 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 108 transitions. Word has length 17 251.16/191.40 [2019-03-28 12:22:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:23,278 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 108 transitions. 251.16/191.40 [2019-03-28 12:22:23,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 251.16/191.40 [2019-03-28 12:22:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. 251.16/191.40 [2019-03-28 12:22:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 251.16/191.40 [2019-03-28 12:22:23,280 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:23,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:23,280 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1598214641, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:23,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:23,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:23,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:23,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:23,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:23,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:23,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:23,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:23,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 20 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:23,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:23,569 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:23,570 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:23,602 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:23,607 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:23,608 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:23,625 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:23,626 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:23,626 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:33 251.16/191.40 [2019-03-28 12:22:23,659 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.40 [2019-03-28 12:22:23,660 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:23,669 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:23,669 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:23,669 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 251.16/191.40 [2019-03-28 12:22:23,709 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.40 [2019-03-28 12:22:23,710 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.40 [2019-03-28 12:22:23,711 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:23,719 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:23,720 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:23,720 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:16 251.16/191.40 [2019-03-28 12:22:23,746 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.40 [2019-03-28 12:22:23,746 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:23,751 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:23,751 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:23,752 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 251.16/191.40 [2019-03-28 12:22:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:23,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:23,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 251.16/191.40 [2019-03-28 12:22:23,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 251.16/191.40 [2019-03-28 12:22:23,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 251.16/191.40 [2019-03-28 12:22:23,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 251.16/191.40 [2019-03-28 12:22:23,795 INFO L87 Difference]: Start difference. First operand 66 states and 108 transitions. Second operand 18 states. 251.16/191.40 [2019-03-28 12:22:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:24,746 INFO L93 Difference]: Finished difference Result 175 states and 266 transitions. 251.16/191.40 [2019-03-28 12:22:24,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 251.16/191.40 [2019-03-28 12:22:24,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 251.16/191.40 [2019-03-28 12:22:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:24,748 INFO L225 Difference]: With dead ends: 175 251.16/191.40 [2019-03-28 12:22:24,748 INFO L226 Difference]: Without dead ends: 170 251.16/191.40 [2019-03-28 12:22:24,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 251.16/191.40 [2019-03-28 12:22:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. 251.16/191.40 [2019-03-28 12:22:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 81. 251.16/191.40 [2019-03-28 12:22:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. 251.16/191.40 [2019-03-28 12:22:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. 251.16/191.40 [2019-03-28 12:22:24,758 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 128 transitions. Word has length 17 251.16/191.40 [2019-03-28 12:22:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:24,758 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 128 transitions. 251.16/191.40 [2019-03-28 12:22:24,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 251.16/191.40 [2019-03-28 12:22:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 128 transitions. 251.16/191.40 [2019-03-28 12:22:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 251.16/191.40 [2019-03-28 12:22:24,759 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:24,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:24,760 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1598214642, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:24,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:24,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:24,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:24,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:24,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:24,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:24,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:24,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 26 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:24,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:24,997 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:24,997 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,008 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:25,008 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,009 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 251.16/191.40 [2019-03-28 12:22:25,061 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:25,062 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,079 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:25,083 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:25,083 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,099 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:25,100 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,100 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 251.16/191.40 [2019-03-28 12:22:25,203 INFO L340 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size 251.16/191.40 [2019-03-28 12:22:25,203 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 251.16/191.40 [2019-03-28 12:22:25,206 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,246 INFO L497 ElimStorePlain]: treesize reduction 10, result has 84.4 percent of original size 251.16/191.40 [2019-03-28 12:22:25,251 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.40 [2019-03-28 12:22:25,252 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 251.16/191.40 [2019-03-28 12:22:25,252 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,266 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:25,267 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,267 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:39 251.16/191.40 [2019-03-28 12:22:25,326 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:25,327 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 251.16/191.40 [2019-03-28 12:22:25,328 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,343 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:25,347 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:25,347 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 251.16/191.40 [2019-03-28 12:22:25,348 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,361 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:25,362 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:25,363 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:12 251.16/191.40 [2019-03-28 12:22:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:25,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:25,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 251.16/191.40 [2019-03-28 12:22:25,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 251.16/191.40 [2019-03-28 12:22:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 251.16/191.40 [2019-03-28 12:22:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 251.16/191.40 [2019-03-28 12:22:25,415 INFO L87 Difference]: Start difference. First operand 81 states and 128 transitions. Second operand 19 states. 251.16/191.40 [2019-03-28 12:22:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:26,613 INFO L93 Difference]: Finished difference Result 172 states and 265 transitions. 251.16/191.40 [2019-03-28 12:22:26,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 251.16/191.40 [2019-03-28 12:22:26,613 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 251.16/191.40 [2019-03-28 12:22:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:26,615 INFO L225 Difference]: With dead ends: 172 251.16/191.40 [2019-03-28 12:22:26,615 INFO L226 Difference]: Without dead ends: 165 251.16/191.40 [2019-03-28 12:22:26,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 251.16/191.40 [2019-03-28 12:22:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. 251.16/191.40 [2019-03-28 12:22:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 80. 251.16/191.40 [2019-03-28 12:22:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. 251.16/191.40 [2019-03-28 12:22:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. 251.16/191.40 [2019-03-28 12:22:26,623 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 17 251.16/191.40 [2019-03-28 12:22:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:26,624 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. 251.16/191.40 [2019-03-28 12:22:26,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 251.16/191.40 [2019-03-28 12:22:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. 251.16/191.40 [2019-03-28 12:22:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 251.16/191.40 [2019-03-28 12:22:26,625 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:26,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:26,625 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:26,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash -395250223, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:26,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:26,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:26,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:26,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:26,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:26,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:26,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:26,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 26 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:26,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:26,813 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:26,813 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:26,819 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:26,820 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:26,820 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.40 [2019-03-28 12:22:26,884 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:26,885 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 251.16/191.40 [2019-03-28 12:22:26,886 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:26,904 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:26,905 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:26,905 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 251.16/191.40 [2019-03-28 12:22:26,939 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:26,939 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:26,958 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:26,981 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:26,981 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:26,995 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:26,996 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:26,996 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 251.16/191.40 [2019-03-28 12:22:27,022 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 251.16/191.40 [2019-03-28 12:22:27,022 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,028 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:27,028 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,028 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:15 251.16/191.40 [2019-03-28 12:22:27,047 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.40 [2019-03-28 12:22:27,048 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,052 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:27,053 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,053 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 251.16/191.40 [2019-03-28 12:22:27,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.40 [2019-03-28 12:22:27,072 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,074 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:27,074 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,074 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 251.16/191.40 [2019-03-28 12:22:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:27,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:27,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 251.16/191.40 [2019-03-28 12:22:27,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 251.16/191.40 [2019-03-28 12:22:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 251.16/191.40 [2019-03-28 12:22:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 251.16/191.40 [2019-03-28 12:22:27,112 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand 16 states. 251.16/191.40 [2019-03-28 12:22:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:27,656 INFO L93 Difference]: Finished difference Result 133 states and 200 transitions. 251.16/191.40 [2019-03-28 12:22:27,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 251.16/191.40 [2019-03-28 12:22:27,656 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 251.16/191.40 [2019-03-28 12:22:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:27,657 INFO L225 Difference]: With dead ends: 133 251.16/191.40 [2019-03-28 12:22:27,657 INFO L226 Difference]: Without dead ends: 131 251.16/191.40 [2019-03-28 12:22:27,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 251.16/191.40 [2019-03-28 12:22:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. 251.16/191.40 [2019-03-28 12:22:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. 251.16/191.40 [2019-03-28 12:22:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. 251.16/191.40 [2019-03-28 12:22:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 159 transitions. 251.16/191.40 [2019-03-28 12:22:27,665 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 159 transitions. Word has length 17 251.16/191.40 [2019-03-28 12:22:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:27,665 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 159 transitions. 251.16/191.40 [2019-03-28 12:22:27,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 251.16/191.40 [2019-03-28 12:22:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 159 transitions. 251.16/191.40 [2019-03-28 12:22:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 251.16/191.40 [2019-03-28 12:22:27,666 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:27,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:27,667 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:27,667 INFO L82 PathProgramCache]: Analyzing trace with hash -395250222, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:27,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:27,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:27,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:27,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:27,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:27,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:27,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:27,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:27,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 30 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:27,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:27,890 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:27,891 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,894 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:27,894 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,895 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.40 [2019-03-28 12:22:27,924 INFO L388 ElimStorePlain]: Different consts {0=[|v_#length_37|], 1=[|v_#valid_42|]} 251.16/191.40 [2019-03-28 12:22:27,928 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:27,928 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,939 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:27,946 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:27,947 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 251.16/191.40 [2019-03-28 12:22:27,947 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,955 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:27,956 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,956 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 251.16/191.40 [2019-03-28 12:22:27,982 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:27,982 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:27,997 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:28,000 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:28,000 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:28,014 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:28,014 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:28,014 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 251.16/191.40 [2019-03-28 12:22:28,079 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:28,080 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 251.16/191.40 [2019-03-28 12:22:28,083 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:28,113 INFO L497 ElimStorePlain]: treesize reduction 34, result has 59.0 percent of original size 251.16/191.40 [2019-03-28 12:22:28,117 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 251.16/191.40 [2019-03-28 12:22:28,118 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:28,127 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:28,128 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:28,128 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:37 251.16/191.40 [2019-03-28 12:22:28,185 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:28,186 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 251.16/191.40 [2019-03-28 12:22:28,186 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:28,199 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:28,202 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:28,203 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 251.16/191.40 [2019-03-28 12:22:28,203 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:28,212 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:28,212 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:28,213 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:9 251.16/191.40 [2019-03-28 12:22:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:28,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:28,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 251.16/191.40 [2019-03-28 12:22:28,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 251.16/191.40 [2019-03-28 12:22:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 251.16/191.40 [2019-03-28 12:22:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 251.16/191.40 [2019-03-28 12:22:28,258 INFO L87 Difference]: Start difference. First operand 100 states and 159 transitions. Second operand 17 states. 251.16/191.40 [2019-03-28 12:22:28,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:28,896 INFO L93 Difference]: Finished difference Result 129 states and 194 transitions. 251.16/191.40 [2019-03-28 12:22:28,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 251.16/191.40 [2019-03-28 12:22:28,896 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 251.16/191.40 [2019-03-28 12:22:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:28,897 INFO L225 Difference]: With dead ends: 129 251.16/191.40 [2019-03-28 12:22:28,898 INFO L226 Difference]: Without dead ends: 123 251.16/191.40 [2019-03-28 12:22:28,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 251.16/191.40 [2019-03-28 12:22:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. 251.16/191.40 [2019-03-28 12:22:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. 251.16/191.40 [2019-03-28 12:22:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. 251.16/191.40 [2019-03-28 12:22:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 136 transitions. 251.16/191.40 [2019-03-28 12:22:28,904 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 136 transitions. Word has length 17 251.16/191.40 [2019-03-28 12:22:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:28,904 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 136 transitions. 251.16/191.40 [2019-03-28 12:22:28,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 251.16/191.40 [2019-03-28 12:22:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 136 transitions. 251.16/191.40 [2019-03-28 12:22:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 251.16/191.40 [2019-03-28 12:22:28,905 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:28,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:28,906 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash -419871347, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:28,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:28,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:28,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:28,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:28,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:29,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:29,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:29,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:29,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:29,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:29,052 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:29,052 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,056 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:29,056 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,056 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.40 [2019-03-28 12:22:29,101 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:29,101 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 251.16/191.40 [2019-03-28 12:22:29,102 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,127 INFO L497 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size 251.16/191.40 [2019-03-28 12:22:29,128 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,128 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 251.16/191.40 [2019-03-28 12:22:29,155 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:29,156 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,167 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:29,168 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,168 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 251.16/191.40 [2019-03-28 12:22:29,229 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:29,229 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 67 251.16/191.40 [2019-03-28 12:22:29,231 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,249 INFO L497 ElimStorePlain]: treesize reduction 36, result has 47.8 percent of original size 251.16/191.40 [2019-03-28 12:22:29,249 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,250 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:33 251.16/191.40 [2019-03-28 12:22:29,302 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:29,303 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 251.16/191.40 [2019-03-28 12:22:29,303 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,312 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:29,313 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:29,313 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:15 251.16/191.40 [2019-03-28 12:22:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:29,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:29,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 251.16/191.40 [2019-03-28 12:22:29,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 251.16/191.40 [2019-03-28 12:22:29,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 251.16/191.40 [2019-03-28 12:22:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 251.16/191.40 [2019-03-28 12:22:29,372 INFO L87 Difference]: Start difference. First operand 86 states and 136 transitions. Second operand 17 states. 251.16/191.40 [2019-03-28 12:22:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:30,025 INFO L93 Difference]: Finished difference Result 105 states and 158 transitions. 251.16/191.40 [2019-03-28 12:22:30,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 251.16/191.40 [2019-03-28 12:22:30,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 251.16/191.40 [2019-03-28 12:22:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:30,026 INFO L225 Difference]: With dead ends: 105 251.16/191.40 [2019-03-28 12:22:30,026 INFO L226 Difference]: Without dead ends: 103 251.16/191.40 [2019-03-28 12:22:30,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 251.16/191.40 [2019-03-28 12:22:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. 251.16/191.40 [2019-03-28 12:22:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. 251.16/191.40 [2019-03-28 12:22:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. 251.16/191.40 [2019-03-28 12:22:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. 251.16/191.40 [2019-03-28 12:22:30,032 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 17 251.16/191.40 [2019-03-28 12:22:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:30,033 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. 251.16/191.40 [2019-03-28 12:22:30,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 251.16/191.40 [2019-03-28 12:22:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. 251.16/191.40 [2019-03-28 12:22:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 251.16/191.40 [2019-03-28 12:22:30,033 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:30,034 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:30,034 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1599062114, now seen corresponding path program 2 times 251.16/191.40 [2019-03-28 12:22:30,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:30,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:30,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:30,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:30,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:30,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:30,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:30,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 251.16/191.40 [2019-03-28 12:22:30,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 251.16/191.40 [2019-03-28 12:22:30,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:30,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:30,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:30,260 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:30,260 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,276 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:30,280 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:30,281 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,295 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:30,296 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,296 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:24 251.16/191.40 [2019-03-28 12:22:30,353 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_int_16|], 2=[|v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_30|]} 251.16/191.40 [2019-03-28 12:22:30,358 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 251.16/191.40 [2019-03-28 12:22:30,358 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,374 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:30,392 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:30,392 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 107 251.16/191.40 [2019-03-28 12:22:30,397 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,428 INFO L497 ElimStorePlain]: treesize reduction 40, result has 57.0 percent of original size 251.16/191.40 [2019-03-28 12:22:30,431 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.40 [2019-03-28 12:22:30,432 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 251.16/191.40 [2019-03-28 12:22:30,433 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,443 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:30,444 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,444 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:31 251.16/191.40 [2019-03-28 12:22:30,474 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 251.16/191.40 [2019-03-28 12:22:30,475 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,483 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:30,486 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 251.16/191.40 [2019-03-28 12:22:30,487 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,493 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:30,494 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,494 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 251.16/191.40 [2019-03-28 12:22:30,516 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.40 [2019-03-28 12:22:30,516 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,520 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:30,520 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:30,520 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:3 251.16/191.40 [2019-03-28 12:22:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:30,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:30,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 251.16/191.40 [2019-03-28 12:22:30,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 251.16/191.40 [2019-03-28 12:22:30,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 251.16/191.40 [2019-03-28 12:22:30,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 251.16/191.40 [2019-03-28 12:22:30,551 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand 16 states. 251.16/191.40 [2019-03-28 12:22:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:31,101 INFO L93 Difference]: Finished difference Result 171 states and 257 transitions. 251.16/191.40 [2019-03-28 12:22:31,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 251.16/191.40 [2019-03-28 12:22:31,101 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 251.16/191.40 [2019-03-28 12:22:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:31,102 INFO L225 Difference]: With dead ends: 171 251.16/191.40 [2019-03-28 12:22:31,102 INFO L226 Difference]: Without dead ends: 152 251.16/191.40 [2019-03-28 12:22:31,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 251.16/191.40 [2019-03-28 12:22:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. 251.16/191.40 [2019-03-28 12:22:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 83. 251.16/191.40 [2019-03-28 12:22:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. 251.16/191.40 [2019-03-28 12:22:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. 251.16/191.40 [2019-03-28 12:22:31,110 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 20 251.16/191.40 [2019-03-28 12:22:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:31,111 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. 251.16/191.40 [2019-03-28 12:22:31,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 251.16/191.40 [2019-03-28 12:22:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. 251.16/191.40 [2019-03-28 12:22:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 251.16/191.40 [2019-03-28 12:22:31,111 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:31,112 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:31,112 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1896943550, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:31,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:31,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:31,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:31,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:31,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:31,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:31,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:31,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:31,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 36 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:31,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:31,306 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:31,307 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,313 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,313 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,313 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.40 [2019-03-28 12:22:31,357 INFO L388 ElimStorePlain]: Different consts {0=[|v_#length_38|], 1=[|v_#valid_46|]} 251.16/191.40 [2019-03-28 12:22:31,361 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:31,362 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,377 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,386 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,386 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 251.16/191.40 [2019-03-28 12:22:31,387 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,398 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,399 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,399 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 251.16/191.40 [2019-03-28 12:22:31,432 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:31,433 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,452 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,457 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:31,457 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,474 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,475 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,475 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 251.16/191.40 [2019-03-28 12:22:31,511 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.40 [2019-03-28 12:22:31,512 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,522 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,522 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,523 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:31 251.16/191.40 [2019-03-28 12:22:31,558 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_int_17|], 2=[|v_#memory_$Pointer$.base_34|]} 251.16/191.40 [2019-03-28 12:22:31,562 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 251.16/191.40 [2019-03-28 12:22:31,562 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,581 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,585 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.40 [2019-03-28 12:22:31,586 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 251.16/191.40 [2019-03-28 12:22:31,587 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,600 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,601 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,601 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:38 251.16/191.40 [2019-03-28 12:22:31,642 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 251.16/191.40 [2019-03-28 12:22:31,642 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,652 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,653 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,654 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:19 251.16/191.40 [2019-03-28 12:22:31,703 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,704 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 251.16/191.40 [2019-03-28 12:22:31,704 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,716 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:31,718 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:31,719 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 251.16/191.40 [2019-03-28 12:22:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:31,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:31,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 251.16/191.40 [2019-03-28 12:22:31,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 251.16/191.40 [2019-03-28 12:22:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 251.16/191.40 [2019-03-28 12:22:31,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 251.16/191.40 [2019-03-28 12:22:31,811 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand 19 states. 251.16/191.40 [2019-03-28 12:22:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:32,718 INFO L93 Difference]: Finished difference Result 117 states and 177 transitions. 251.16/191.40 [2019-03-28 12:22:32,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 251.16/191.40 [2019-03-28 12:22:32,719 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 251.16/191.40 [2019-03-28 12:22:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:32,720 INFO L225 Difference]: With dead ends: 117 251.16/191.40 [2019-03-28 12:22:32,720 INFO L226 Difference]: Without dead ends: 98 251.16/191.40 [2019-03-28 12:22:32,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 251.16/191.40 [2019-03-28 12:22:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. 251.16/191.40 [2019-03-28 12:22:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. 251.16/191.40 [2019-03-28 12:22:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. 251.16/191.40 [2019-03-28 12:22:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. 251.16/191.40 [2019-03-28 12:22:32,727 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 20 251.16/191.40 [2019-03-28 12:22:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:32,727 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. 251.16/191.40 [2019-03-28 12:22:32,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 251.16/191.40 [2019-03-28 12:22:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. 251.16/191.40 [2019-03-28 12:22:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 251.16/191.40 [2019-03-28 12:22:32,728 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:32,728 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:32,728 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1019929642, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:32,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:32,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:32,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:32,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:32,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:32,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:32,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:32,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:32,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:32,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:32,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:32,985 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,001 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:33,006 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:33,006 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,021 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:33,022 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,022 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:22 251.16/191.40 [2019-03-28 12:22:33,088 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_int_18|], 2=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_33|]} 251.16/191.40 [2019-03-28 12:22:33,094 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 251.16/191.40 [2019-03-28 12:22:33,094 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,115 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:33,138 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:33,139 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 131 251.16/191.40 [2019-03-28 12:22:33,144 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,186 INFO L497 ElimStorePlain]: treesize reduction 52, result has 54.4 percent of original size 251.16/191.40 [2019-03-28 12:22:33,192 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.40 [2019-03-28 12:22:33,193 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 251.16/191.40 [2019-03-28 12:22:33,193 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,206 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:33,207 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,208 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:138, output treesize:38 251.16/191.40 [2019-03-28 12:22:33,291 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:33,293 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 251.16/191.40 [2019-03-28 12:22:33,293 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,309 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:33,314 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:33,317 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.40 [2019-03-28 12:22:33,318 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,330 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:33,331 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,331 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:59, output treesize:11 251.16/191.40 [2019-03-28 12:22:33,360 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.40 [2019-03-28 12:22:33,361 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,365 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:33,365 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:33,366 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:3 251.16/191.40 [2019-03-28 12:22:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:33,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:33,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 251.16/191.40 [2019-03-28 12:22:33,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states 251.16/191.40 [2019-03-28 12:22:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. 251.16/191.40 [2019-03-28 12:22:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 251.16/191.40 [2019-03-28 12:22:33,416 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand 22 states. 251.16/191.40 [2019-03-28 12:22:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:34,527 INFO L93 Difference]: Finished difference Result 166 states and 246 transitions. 251.16/191.40 [2019-03-28 12:22:34,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 251.16/191.40 [2019-03-28 12:22:34,542 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 251.16/191.40 [2019-03-28 12:22:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:34,543 INFO L225 Difference]: With dead ends: 166 251.16/191.40 [2019-03-28 12:22:34,543 INFO L226 Difference]: Without dead ends: 146 251.16/191.40 [2019-03-28 12:22:34,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 251.16/191.40 [2019-03-28 12:22:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. 251.16/191.40 [2019-03-28 12:22:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 79. 251.16/191.40 [2019-03-28 12:22:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. 251.16/191.40 [2019-03-28 12:22:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. 251.16/191.40 [2019-03-28 12:22:34,551 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 22 251.16/191.40 [2019-03-28 12:22:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:34,551 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. 251.16/191.40 [2019-03-28 12:22:34,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. 251.16/191.40 [2019-03-28 12:22:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. 251.16/191.40 [2019-03-28 12:22:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 251.16/191.40 [2019-03-28 12:22:34,552 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:34,552 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:34,552 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2016947274, now seen corresponding path program 1 times 251.16/191.40 [2019-03-28 12:22:34,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:34,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:34,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:34,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:34,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:34,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:34,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:34,740 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:34,741 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,744 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:34,745 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,745 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.40 [2019-03-28 12:22:34,784 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:34,785 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 251.16/191.40 [2019-03-28 12:22:34,785 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,790 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:34,791 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,791 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 251.16/191.40 [2019-03-28 12:22:34,814 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:34,814 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,825 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:34,828 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:34,829 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,839 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:34,840 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,840 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:20 251.16/191.40 [2019-03-28 12:22:34,883 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_int_19|], 2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_35|]} 251.16/191.40 [2019-03-28 12:22:34,888 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 251.16/191.40 [2019-03-28 12:22:34,888 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,903 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:34,920 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:34,921 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 251.16/191.40 [2019-03-28 12:22:34,923 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,951 INFO L497 ElimStorePlain]: treesize reduction 52, result has 53.6 percent of original size 251.16/191.40 [2019-03-28 12:22:34,954 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 251.16/191.40 [2019-03-28 12:22:34,955 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,964 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:34,965 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:34,965 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:136, output treesize:36 251.16/191.40 [2019-03-28 12:22:35,022 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:35,023 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 251.16/191.40 [2019-03-28 12:22:35,023 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:35,041 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:35,045 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:35,045 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.40 [2019-03-28 12:22:35,046 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:35,056 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:35,057 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:35,057 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:7 251.16/191.40 [2019-03-28 12:22:35,060 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.40 [2019-03-28 12:22:35,060 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:35,062 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:35,062 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:35,062 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 251.16/191.40 [2019-03-28 12:22:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:35,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:35,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 251.16/191.40 [2019-03-28 12:22:35,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 251.16/191.40 [2019-03-28 12:22:35,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 251.16/191.40 [2019-03-28 12:22:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 251.16/191.40 [2019-03-28 12:22:35,111 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand 20 states. 251.16/191.40 [2019-03-28 12:22:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:35,944 INFO L93 Difference]: Finished difference Result 100 states and 150 transitions. 251.16/191.40 [2019-03-28 12:22:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 251.16/191.40 [2019-03-28 12:22:35,945 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 251.16/191.40 [2019-03-28 12:22:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:35,946 INFO L225 Difference]: With dead ends: 100 251.16/191.40 [2019-03-28 12:22:35,946 INFO L226 Difference]: Without dead ends: 80 251.16/191.40 [2019-03-28 12:22:35,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 251.16/191.40 [2019-03-28 12:22:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. 251.16/191.40 [2019-03-28 12:22:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. 251.16/191.40 [2019-03-28 12:22:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 251.16/191.40 [2019-03-28 12:22:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. 251.16/191.40 [2019-03-28 12:22:35,951 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 22 251.16/191.40 [2019-03-28 12:22:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:35,951 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. 251.16/191.40 [2019-03-28 12:22:35,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 251.16/191.40 [2019-03-28 12:22:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. 251.16/191.40 [2019-03-28 12:22:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 251.16/191.40 [2019-03-28 12:22:35,952 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:35,952 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:35,952 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:35,952 INFO L82 PathProgramCache]: Analyzing trace with hash -622045415, now seen corresponding path program 3 times 251.16/191.40 [2019-03-28 12:22:35,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:35,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:35,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:35,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:35,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:36,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:36,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:36,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 251.16/191.40 [2019-03-28 12:22:36,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) 251.16/191.40 [2019-03-28 12:22:36,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:36,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 34 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:36,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:36,215 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:36,216 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,229 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:36,232 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:36,232 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,245 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:36,245 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,245 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:24 251.16/191.40 [2019-03-28 12:22:36,273 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.40 [2019-03-28 12:22:36,274 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,280 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:36,280 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,281 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 251.16/191.40 [2019-03-28 12:22:36,311 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.40 [2019-03-28 12:22:36,312 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.40 [2019-03-28 12:22:36,312 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,319 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:36,320 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,320 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 251.16/191.40 [2019-03-28 12:22:36,346 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.40 [2019-03-28 12:22:36,346 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,355 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:36,355 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,355 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 251.16/191.40 [2019-03-28 12:22:36,416 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:36,425 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:36,425 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 251.16/191.40 [2019-03-28 12:22:36,425 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,460 INFO L497 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size 251.16/191.40 [2019-03-28 12:22:36,461 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,461 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:51 251.16/191.40 [2019-03-28 12:22:36,604 INFO L340 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size 251.16/191.40 [2019-03-28 12:22:36,605 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 50 251.16/191.40 [2019-03-28 12:22:36,606 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,616 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:36,663 INFO L340 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size 251.16/191.40 [2019-03-28 12:22:36,664 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 76 251.16/191.40 [2019-03-28 12:22:36,670 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,788 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 251.16/191.40 [2019-03-28 12:22:36,789 INFO L497 ElimStorePlain]: treesize reduction 26, result has 79.0 percent of original size 251.16/191.40 [2019-03-28 12:22:36,792 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,792 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:145, output treesize:111 251.16/191.40 [2019-03-28 12:22:36,956 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 251.16/191.40 [2019-03-28 12:22:36,957 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:36,960 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.40 [2019-03-28 12:22:36,965 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:36,965 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 39 251.16/191.40 [2019-03-28 12:22:36,966 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:37,015 INFO L497 ElimStorePlain]: treesize reduction 4, result has 92.9 percent of original size 251.16/191.40 [2019-03-28 12:22:37,016 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 251.16/191.40 [2019-03-28 12:22:37,016 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:32 251.16/191.40 [2019-03-28 12:22:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:37,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.40 [2019-03-28 12:22:37,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 251.16/191.40 [2019-03-28 12:22:37,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states 251.16/191.40 [2019-03-28 12:22:37,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. 251.16/191.40 [2019-03-28 12:22:37,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 251.16/191.40 [2019-03-28 12:22:37,092 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand 23 states. 251.16/191.40 [2019-03-28 12:22:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.40 [2019-03-28 12:22:38,838 INFO L93 Difference]: Finished difference Result 217 states and 325 transitions. 251.16/191.40 [2019-03-28 12:22:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 251.16/191.40 [2019-03-28 12:22:38,838 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 251.16/191.40 [2019-03-28 12:22:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.40 [2019-03-28 12:22:38,839 INFO L225 Difference]: With dead ends: 217 251.16/191.40 [2019-03-28 12:22:38,839 INFO L226 Difference]: Without dead ends: 183 251.16/191.40 [2019-03-28 12:22:38,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=358, Invalid=1534, Unknown=0, NotChecked=0, Total=1892 251.16/191.40 [2019-03-28 12:22:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. 251.16/191.40 [2019-03-28 12:22:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 93. 251.16/191.40 [2019-03-28 12:22:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. 251.16/191.40 [2019-03-28 12:22:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 147 transitions. 251.16/191.40 [2019-03-28 12:22:38,847 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 147 transitions. Word has length 23 251.16/191.40 [2019-03-28 12:22:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.40 [2019-03-28 12:22:38,847 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 147 transitions. 251.16/191.40 [2019-03-28 12:22:38,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. 251.16/191.40 [2019-03-28 12:22:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 147 transitions. 251.16/191.40 [2019-03-28 12:22:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 251.16/191.40 [2019-03-28 12:22:38,848 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.40 [2019-03-28 12:22:38,848 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.40 [2019-03-28 12:22:38,848 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.40 [2019-03-28 12:22:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.40 [2019-03-28 12:22:38,848 INFO L82 PathProgramCache]: Analyzing trace with hash -622045413, now seen corresponding path program 2 times 251.16/191.40 [2019-03-28 12:22:38,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.40 [2019-03-28 12:22:38,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.40 [2019-03-28 12:22:38,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:38,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:38,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.40 [2019-03-28 12:22:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.40 [2019-03-28 12:22:39,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.40 [2019-03-28 12:22:39,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.40 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.40 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.40 [2019-03-28 12:22:39,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 251.16/191.40 [2019-03-28 12:22:39,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 251.16/191.40 [2019-03-28 12:22:39,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.40 [2019-03-28 12:22:39,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core 251.16/191.40 [2019-03-28 12:22:39,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.40 [2019-03-28 12:22:39,083 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:39,083 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:39,097 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:39,100 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:39,100 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:39,112 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:39,113 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:39,113 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:33 251.16/191.40 [2019-03-28 12:22:39,139 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.40 [2019-03-28 12:22:39,139 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:39,145 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:39,146 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:39,146 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 251.16/191.40 [2019-03-28 12:22:39,166 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.40 [2019-03-28 12:22:39,167 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.40 [2019-03-28 12:22:39,168 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:39,174 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.40 [2019-03-28 12:22:39,174 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:39,174 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 251.16/191.40 [2019-03-28 12:22:39,196 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_$Pointer$.base_44|], 2=[|v_#memory_$Pointer$.offset_39|]} 251.16/191.40 [2019-03-28 12:22:39,200 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.40 [2019-03-28 12:22:39,200 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.40 [2019-03-28 12:22:39,215 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:39,220 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:39,221 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.41 [2019-03-28 12:22:39,221 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:39,233 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:39,234 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:39,234 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:28 251.16/191.41 [2019-03-28 12:22:39,261 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 251.16/191.41 [2019-03-28 12:22:39,261 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:39,268 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:39,269 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:39,269 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:19 251.16/191.41 [2019-03-28 12:22:39,286 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:39,287 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.41 [2019-03-28 12:22:39,287 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:39,293 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:39,293 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:39,294 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:16 251.16/191.41 [2019-03-28 12:22:39,314 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.41 [2019-03-28 12:22:39,314 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:39,317 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:39,318 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:39,318 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 251.16/191.41 [2019-03-28 12:22:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:39,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:22:39,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 251.16/191.41 [2019-03-28 12:22:39,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 251.16/191.41 [2019-03-28 12:22:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 251.16/191.41 [2019-03-28 12:22:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 251.16/191.41 [2019-03-28 12:22:39,358 INFO L87 Difference]: Start difference. First operand 93 states and 147 transitions. Second operand 20 states. 251.16/191.41 [2019-03-28 12:22:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:22:40,558 INFO L93 Difference]: Finished difference Result 236 states and 361 transitions. 251.16/191.41 [2019-03-28 12:22:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 251.16/191.41 [2019-03-28 12:22:40,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 251.16/191.41 [2019-03-28 12:22:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:22:40,560 INFO L225 Difference]: With dead ends: 236 251.16/191.41 [2019-03-28 12:22:40,560 INFO L226 Difference]: Without dead ends: 202 251.16/191.41 [2019-03-28 12:22:40,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 251.16/191.41 [2019-03-28 12:22:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. 251.16/191.41 [2019-03-28 12:22:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 144. 251.16/191.41 [2019-03-28 12:22:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. 251.16/191.41 [2019-03-28 12:22:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 228 transitions. 251.16/191.41 [2019-03-28 12:22:40,570 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 228 transitions. Word has length 23 251.16/191.41 [2019-03-28 12:22:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:22:40,571 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 228 transitions. 251.16/191.41 [2019-03-28 12:22:40,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 251.16/191.41 [2019-03-28 12:22:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 228 transitions. 251.16/191.41 [2019-03-28 12:22:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 251.16/191.41 [2019-03-28 12:22:40,571 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:22:40,572 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:22:40,572 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:22:40,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:22:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash -622045412, now seen corresponding path program 2 times 251.16/191.41 [2019-03-28 12:22:40,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:22:40,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:22:40,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:40,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:40,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:40,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:22:40,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:22:40,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 251.16/191.41 [2019-03-28 12:22:40,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 251.16/191.41 [2019-03-28 12:22:40,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:40,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 38 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:22:40,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:22:40,850 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:22:40,850 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:40,865 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:40,868 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:22:40,869 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:40,883 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:40,883 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:40,883 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:33 251.16/191.41 [2019-03-28 12:22:40,958 INFO L340 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size 251.16/191.41 [2019-03-28 12:22:40,959 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 251.16/191.41 [2019-03-28 12:22:40,959 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:40,984 INFO L497 ElimStorePlain]: treesize reduction 8, result has 83.7 percent of original size 251.16/191.41 [2019-03-28 12:22:40,988 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:40,989 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.41 [2019-03-28 12:22:40,989 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:40,998 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:40,998 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:40,998 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:26 251.16/191.41 [2019-03-28 12:22:41,064 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:41,065 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 51 251.16/191.41 [2019-03-28 12:22:41,066 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:41,112 INFO L497 ElimStorePlain]: treesize reduction 28, result has 69.2 percent of original size 251.16/191.41 [2019-03-28 12:22:41,116 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:41,117 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.41 [2019-03-28 12:22:41,118 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:41,136 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:41,137 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:41,137 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:47 251.16/191.41 [2019-03-28 12:22:41,218 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_44|], 6=[|v_#memory_$Pointer$.base_48|]} 251.16/191.41 [2019-03-28 12:22:41,224 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:41,225 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.41 [2019-03-28 12:22:41,225 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:41,250 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:41,322 INFO L340 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size 251.16/191.41 [2019-03-28 12:22:41,323 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 68 251.16/191.41 [2019-03-28 12:22:41,328 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 251.16/191.41 [2019-03-28 12:22:41,397 INFO L497 ElimStorePlain]: treesize reduction 54, result has 60.0 percent of original size 251.16/191.41 [2019-03-28 12:22:41,399 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:41,399 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:71 251.16/191.41 [2019-03-28 12:22:41,451 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 251.16/191.41 [2019-03-28 12:22:41,451 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:41,459 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:41,461 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.41 [2019-03-28 12:22:41,462 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:41,467 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:41,468 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:41,468 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:12 251.16/191.41 [2019-03-28 12:22:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:22:41,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 251.16/191.41 [2019-03-28 12:22:41,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states 251.16/191.41 [2019-03-28 12:22:41,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. 251.16/191.41 [2019-03-28 12:22:41,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 251.16/191.41 [2019-03-28 12:22:41,520 INFO L87 Difference]: Start difference. First operand 144 states and 228 transitions. Second operand 21 states. 251.16/191.41 [2019-03-28 12:22:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:22:42,883 INFO L93 Difference]: Finished difference Result 209 states and 317 transitions. 251.16/191.41 [2019-03-28 12:22:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 251.16/191.41 [2019-03-28 12:22:42,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 251.16/191.41 [2019-03-28 12:22:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:22:42,884 INFO L225 Difference]: With dead ends: 209 251.16/191.41 [2019-03-28 12:22:42,884 INFO L226 Difference]: Without dead ends: 203 251.16/191.41 [2019-03-28 12:22:42,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 251.16/191.41 [2019-03-28 12:22:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. 251.16/191.41 [2019-03-28 12:22:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 143. 251.16/191.41 [2019-03-28 12:22:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. 251.16/191.41 [2019-03-28 12:22:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 226 transitions. 251.16/191.41 [2019-03-28 12:22:42,894 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 226 transitions. Word has length 23 251.16/191.41 [2019-03-28 12:22:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:22:42,894 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 226 transitions. 251.16/191.41 [2019-03-28 12:22:42,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. 251.16/191.41 [2019-03-28 12:22:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 226 transitions. 251.16/191.41 [2019-03-28 12:22:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 251.16/191.41 [2019-03-28 12:22:42,895 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:22:42,895 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:22:42,895 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:22:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:22:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1679457017, now seen corresponding path program 1 times 251.16/191.41 [2019-03-28 12:22:42,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:22:42,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:22:42,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:42,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:42,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:43,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:22:43,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:22:43,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:43,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 36 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:22:43,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:22:43,112 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:22:43,112 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,116 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:43,116 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,117 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:22:43,180 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:43,181 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 251.16/191.41 [2019-03-28 12:22:43,182 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,193 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:43,194 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,194 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 251.16/191.41 [2019-03-28 12:22:43,228 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:22:43,228 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,242 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:43,243 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,243 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38 251.16/191.41 [2019-03-28 12:22:43,331 INFO L340 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size 251.16/191.41 [2019-03-28 12:22:43,332 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 251.16/191.41 [2019-03-28 12:22:43,332 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,353 INFO L497 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size 251.16/191.41 [2019-03-28 12:22:43,353 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,354 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:29 251.16/191.41 [2019-03-28 12:22:43,379 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:43,381 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:43,385 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:43,385 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 251.16/191.41 [2019-03-28 12:22:43,386 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,395 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:43,395 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,396 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:32 251.16/191.41 [2019-03-28 12:22:43,453 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:43,454 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 59 251.16/191.41 [2019-03-28 12:22:43,454 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,501 INFO L497 ElimStorePlain]: treesize reduction 34, result has 54.1 percent of original size 251.16/191.41 [2019-03-28 12:22:43,501 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,501 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 251.16/191.41 [2019-03-28 12:22:43,623 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:43,623 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 135 251.16/191.41 [2019-03-28 12:22:43,633 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,679 INFO L497 ElimStorePlain]: treesize reduction 84, result has 33.9 percent of original size 251.16/191.41 [2019-03-28 12:22:43,680 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,681 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:112, output treesize:61 251.16/191.41 [2019-03-28 12:22:43,770 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:22:43,777 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:43,777 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 38 251.16/191.41 [2019-03-28 12:22:43,778 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,799 INFO L497 ElimStorePlain]: treesize reduction 21, result has 50.0 percent of original size 251.16/191.41 [2019-03-28 12:22:43,800 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:43,800 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:9 251.16/191.41 [2019-03-28 12:22:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:43,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:22:43,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 251.16/191.41 [2019-03-28 12:22:43,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states 251.16/191.41 [2019-03-28 12:22:43,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. 251.16/191.41 [2019-03-28 12:22:43,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 251.16/191.41 [2019-03-28 12:22:43,857 INFO L87 Difference]: Start difference. First operand 143 states and 226 transitions. Second operand 24 states. 251.16/191.41 [2019-03-28 12:22:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:22:46,487 INFO L93 Difference]: Finished difference Result 334 states and 519 transitions. 251.16/191.41 [2019-03-28 12:22:46,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 251.16/191.41 [2019-03-28 12:22:46,487 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 251.16/191.41 [2019-03-28 12:22:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:22:46,489 INFO L225 Difference]: With dead ends: 334 251.16/191.41 [2019-03-28 12:22:46,489 INFO L226 Difference]: Without dead ends: 264 251.16/191.41 [2019-03-28 12:22:46,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=381, Invalid=1689, Unknown=0, NotChecked=0, Total=2070 251.16/191.41 [2019-03-28 12:22:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. 251.16/191.41 [2019-03-28 12:22:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 143. 251.16/191.41 [2019-03-28 12:22:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. 251.16/191.41 [2019-03-28 12:22:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 224 transitions. 251.16/191.41 [2019-03-28 12:22:46,500 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 224 transitions. Word has length 23 251.16/191.41 [2019-03-28 12:22:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:22:46,500 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 224 transitions. 251.16/191.41 [2019-03-28 12:22:46,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. 251.16/191.41 [2019-03-28 12:22:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 224 transitions. 251.16/191.41 [2019-03-28 12:22:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 251.16/191.41 [2019-03-28 12:22:46,501 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:22:46,501 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:22:46,501 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:22:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:22:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1679457019, now seen corresponding path program 1 times 251.16/191.41 [2019-03-28 12:22:46,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:22:46,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:22:46,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:46,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:46,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:46,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:22:46,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:22:46,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:46,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 37 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:22:46,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:22:46,713 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:22:46,713 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:46,718 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:46,718 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:46,718 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 251.16/191.41 [2019-03-28 12:22:46,784 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:46,785 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 251.16/191.41 [2019-03-28 12:22:46,785 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:46,800 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:46,800 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:46,800 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 251.16/191.41 [2019-03-28 12:22:46,838 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:22:46,839 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:46,861 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:46,865 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:22:46,865 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:46,885 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:46,886 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:46,886 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:50 251.16/191.41 [2019-03-28 12:22:46,928 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 251.16/191.41 [2019-03-28 12:22:46,929 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:46,942 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:46,943 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:46,943 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:35 251.16/191.41 [2019-03-28 12:22:46,986 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:46,987 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 251.16/191.41 [2019-03-28 12:22:46,987 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,002 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:47,003 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,003 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:35 251.16/191.41 [2019-03-28 12:22:47,009 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:47,011 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:47,015 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:47,015 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 251.16/191.41 [2019-03-28 12:22:47,015 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,030 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:47,030 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,031 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 251.16/191.41 [2019-03-28 12:22:47,071 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_$Pointer$.base_54|], 2=[|v_#memory_$Pointer$.offset_47|]} 251.16/191.41 [2019-03-28 12:22:47,076 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:22:47,076 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,098 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:47,103 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:47,104 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 251.16/191.41 [2019-03-28 12:22:47,104 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,124 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:47,125 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,125 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:44 251.16/191.41 [2019-03-28 12:22:47,170 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 251.16/191.41 [2019-03-28 12:22:47,171 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,185 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:47,185 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,186 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:29 251.16/191.41 [2019-03-28 12:22:47,229 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 251.16/191.41 [2019-03-28 12:22:47,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,241 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:47,242 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,242 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:22 251.16/191.41 [2019-03-28 12:22:47,280 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:22:47,281 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 251.16/191.41 [2019-03-28 12:22:47,281 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,292 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:47,292 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:47,292 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:3 251.16/191.41 [2019-03-28 12:22:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:47,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:22:47,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 251.16/191.41 [2019-03-28 12:22:47,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states 251.16/191.41 [2019-03-28 12:22:47,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. 251.16/191.41 [2019-03-28 12:22:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 251.16/191.41 [2019-03-28 12:22:47,344 INFO L87 Difference]: Start difference. First operand 143 states and 224 transitions. Second operand 23 states. 251.16/191.41 [2019-03-28 12:22:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:22:49,644 INFO L93 Difference]: Finished difference Result 310 states and 474 transitions. 251.16/191.41 [2019-03-28 12:22:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 251.16/191.41 [2019-03-28 12:22:49,645 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 251.16/191.41 [2019-03-28 12:22:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:22:49,646 INFO L225 Difference]: With dead ends: 310 251.16/191.41 [2019-03-28 12:22:49,647 INFO L226 Difference]: Without dead ends: 308 251.16/191.41 [2019-03-28 12:22:49,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=382, Invalid=1424, Unknown=0, NotChecked=0, Total=1806 251.16/191.41 [2019-03-28 12:22:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. 251.16/191.41 [2019-03-28 12:22:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 228. 251.16/191.41 [2019-03-28 12:22:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. 251.16/191.41 [2019-03-28 12:22:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 355 transitions. 251.16/191.41 [2019-03-28 12:22:49,661 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 355 transitions. Word has length 23 251.16/191.41 [2019-03-28 12:22:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:22:49,662 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 355 transitions. 251.16/191.41 [2019-03-28 12:22:49,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. 251.16/191.41 [2019-03-28 12:22:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 355 transitions. 251.16/191.41 [2019-03-28 12:22:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 251.16/191.41 [2019-03-28 12:22:49,663 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:22:49,663 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:22:49,663 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:22:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:22:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1679457020, now seen corresponding path program 1 times 251.16/191.41 [2019-03-28 12:22:49,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:22:49,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:22:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:49,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:49,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:22:49,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:22:49,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:49,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 42 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:22:49,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:22:49,989 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:22:49,990 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:49,994 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:49,995 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:49,995 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:22:50,127 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:50,188 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 251.16/191.41 [2019-03-28 12:22:50,189 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,203 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,204 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,204 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 251.16/191.41 [2019-03-28 12:22:50,287 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:22:50,287 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,310 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,314 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:22:50,314 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,335 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,336 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,336 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:44 251.16/191.41 [2019-03-28 12:22:50,456 INFO L340 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size 251.16/191.41 [2019-03-28 12:22:50,457 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 251.16/191.41 [2019-03-28 12:22:50,457 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,495 INFO L497 ElimStorePlain]: treesize reduction 10, result has 84.8 percent of original size 251.16/191.41 [2019-03-28 12:22:50,499 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:50,501 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 251.16/191.41 [2019-03-28 12:22:50,501 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,515 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,516 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,516 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:41 251.16/191.41 [2019-03-28 12:22:50,557 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:50,560 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:50,564 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,565 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 251.16/191.41 [2019-03-28 12:22:50,565 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,579 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,580 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,580 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:41 251.16/191.41 [2019-03-28 12:22:50,644 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,644 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 59 251.16/191.41 [2019-03-28 12:22:50,645 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,696 INFO L497 ElimStorePlain]: treesize reduction 34, result has 67.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,700 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:22:50,701 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 251.16/191.41 [2019-03-28 12:22:50,702 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,722 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,722 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,722 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:59 251.16/191.41 [2019-03-28 12:22:50,822 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_52|], 6=[|v_#memory_$Pointer$.base_58|]} 251.16/191.41 [2019-03-28 12:22:50,827 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 13 251.16/191.41 [2019-03-28 12:22:50,827 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,850 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,896 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:50,897 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 137 251.16/191.41 [2019-03-28 12:22:50,915 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,984 INFO L497 ElimStorePlain]: treesize reduction 84, result has 41.3 percent of original size 251.16/191.41 [2019-03-28 12:22:50,985 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:50,985 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:179, output treesize:77 251.16/191.41 [2019-03-28 12:22:51,110 INFO L388 ElimStorePlain]: Different consts {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} 251.16/191.41 [2019-03-28 12:22:51,115 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:22:51,116 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 251.16/191.41 [2019-03-28 12:22:51,116 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:51,140 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:51,143 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:22:51,151 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:51,151 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 40 251.16/191.41 [2019-03-28 12:22:51,152 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:51,181 INFO L497 ElimStorePlain]: treesize reduction 21, result has 59.6 percent of original size 251.16/191.41 [2019-03-28 12:22:51,182 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:51,182 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:12 251.16/191.41 [2019-03-28 12:22:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:51,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:22:51,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 251.16/191.41 [2019-03-28 12:22:51,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states 251.16/191.41 [2019-03-28 12:22:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. 251.16/191.41 [2019-03-28 12:22:51,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 251.16/191.41 [2019-03-28 12:22:51,249 INFO L87 Difference]: Start difference. First operand 228 states and 355 transitions. Second operand 26 states. 251.16/191.41 [2019-03-28 12:22:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:22:54,720 INFO L93 Difference]: Finished difference Result 379 states and 577 transitions. 251.16/191.41 [2019-03-28 12:22:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 251.16/191.41 [2019-03-28 12:22:54,721 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 23 251.16/191.41 [2019-03-28 12:22:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:22:54,723 INFO L225 Difference]: With dead ends: 379 251.16/191.41 [2019-03-28 12:22:54,723 INFO L226 Difference]: Without dead ends: 372 251.16/191.41 [2019-03-28 12:22:54,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=296, Invalid=1684, Unknown=0, NotChecked=0, Total=1980 251.16/191.41 [2019-03-28 12:22:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. 251.16/191.41 [2019-03-28 12:22:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 211. 251.16/191.41 [2019-03-28 12:22:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. 251.16/191.41 [2019-03-28 12:22:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 329 transitions. 251.16/191.41 [2019-03-28 12:22:54,738 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 329 transitions. Word has length 23 251.16/191.41 [2019-03-28 12:22:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:22:54,738 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 329 transitions. 251.16/191.41 [2019-03-28 12:22:54,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. 251.16/191.41 [2019-03-28 12:22:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 329 transitions. 251.16/191.41 [2019-03-28 12:22:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 251.16/191.41 [2019-03-28 12:22:54,739 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:22:54,739 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:22:54,739 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:22:54,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:22:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1423514679, now seen corresponding path program 2 times 251.16/191.41 [2019-03-28 12:22:54,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:22:54,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:22:54,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:54,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:54,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:22:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:54,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:22:54,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:22:54,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 251.16/191.41 [2019-03-28 12:22:54,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 251.16/191.41 [2019-03-28 12:22:54,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:22:54,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 37 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:22:54,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:22:54,934 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:22:54,934 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:54,938 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:54,938 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:54,938 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:22:54,957 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:54,957 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 251.16/191.41 [2019-03-28 12:22:54,958 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:54,979 INFO L497 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size 251.16/191.41 [2019-03-28 12:22:54,979 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:54,979 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 251.16/191.41 [2019-03-28 12:22:55,006 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:22:55,006 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,017 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:55,018 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,018 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 251.16/191.41 [2019-03-28 12:22:55,081 INFO L340 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size 251.16/191.41 [2019-03-28 12:22:55,082 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 251.16/191.41 [2019-03-28 12:22:55,082 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,099 INFO L497 ElimStorePlain]: treesize reduction 8, result has 75.8 percent of original size 251.16/191.41 [2019-03-28 12:22:55,099 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,100 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:25 251.16/191.41 [2019-03-28 12:22:55,127 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:55,128 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 251.16/191.41 [2019-03-28 12:22:55,128 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,136 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:55,136 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,137 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 251.16/191.41 [2019-03-28 12:22:55,176 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:55,176 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 56 251.16/191.41 [2019-03-28 12:22:55,177 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,203 INFO L497 ElimStorePlain]: treesize reduction 28, result has 56.9 percent of original size 251.16/191.41 [2019-03-28 12:22:55,203 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,204 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:40 251.16/191.41 [2019-03-28 12:22:55,300 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:55,300 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 127 251.16/191.41 [2019-03-28 12:22:55,305 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,342 INFO L497 ElimStorePlain]: treesize reduction 76, result has 32.7 percent of original size 251.16/191.41 [2019-03-28 12:22:55,343 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,343 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:98, output treesize:53 251.16/191.41 [2019-03-28 12:22:55,386 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:22:55,386 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 38 251.16/191.41 [2019-03-28 12:22:55,387 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,396 INFO L497 ElimStorePlain]: treesize reduction 10, result has 50.0 percent of original size 251.16/191.41 [2019-03-28 12:22:55,397 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:22:55,397 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:5 251.16/191.41 [2019-03-28 12:22:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:22:55,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:22:55,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 251.16/191.41 [2019-03-28 12:22:55,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 251.16/191.41 [2019-03-28 12:22:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 251.16/191.41 [2019-03-28 12:22:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 251.16/191.41 [2019-03-28 12:22:55,428 INFO L87 Difference]: Start difference. First operand 211 states and 329 transitions. Second operand 19 states. 251.16/191.41 [2019-03-28 12:23:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:06,486 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. 251.16/191.41 [2019-03-28 12:23:06,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 251.16/191.41 [2019-03-28 12:23:06,487 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 251.16/191.41 [2019-03-28 12:23:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:06,488 INFO L225 Difference]: With dead ends: 296 251.16/191.41 [2019-03-28 12:23:06,488 INFO L226 Difference]: Without dead ends: 294 251.16/191.41 [2019-03-28 12:23:06,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 251.16/191.41 [2019-03-28 12:23:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. 251.16/191.41 [2019-03-28 12:23:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 232. 251.16/191.41 [2019-03-28 12:23:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. 251.16/191.41 [2019-03-28 12:23:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 364 transitions. 251.16/191.41 [2019-03-28 12:23:06,503 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 364 transitions. Word has length 23 251.16/191.41 [2019-03-28 12:23:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:06,503 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 364 transitions. 251.16/191.41 [2019-03-28 12:23:06,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 251.16/191.41 [2019-03-28 12:23:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 364 transitions. 251.16/191.41 [2019-03-28 12:23:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 251.16/191.41 [2019-03-28 12:23:06,504 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:06,504 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:06,505 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1423514681, now seen corresponding path program 1 times 251.16/191.41 [2019-03-28 12:23:06,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:06,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:06,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:06,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:06,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:06,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:06,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:06,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:06,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 36 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:06,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:06,736 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:06,736 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,740 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:06,740 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,740 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:23:06,787 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:06,788 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 251.16/191.41 [2019-03-28 12:23:06,788 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,812 INFO L497 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size 251.16/191.41 [2019-03-28 12:23:06,813 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,813 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 251.16/191.41 [2019-03-28 12:23:06,840 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:06,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,857 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:06,860 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:06,860 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,876 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:06,877 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,877 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 251.16/191.41 [2019-03-28 12:23:06,908 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 251.16/191.41 [2019-03-28 12:23:06,908 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,917 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:06,917 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,917 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 251.16/191.41 [2019-03-28 12:23:06,944 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.41 [2019-03-28 12:23:06,944 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,954 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:06,954 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,955 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 251.16/191.41 [2019-03-28 12:23:06,967 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:06,968 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 251.16/191.41 [2019-03-28 12:23:06,968 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,976 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:06,976 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:06,976 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 251.16/191.41 [2019-03-28 12:23:06,998 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_$Pointer$.base_64|], 2=[|v_#memory_$Pointer$.offset_55|]} 251.16/191.41 [2019-03-28 12:23:07,002 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:07,002 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:07,015 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:07,018 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.41 [2019-03-28 12:23:07,018 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:07,030 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:07,030 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:07,030 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:35 251.16/191.41 [2019-03-28 12:23:07,056 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 251.16/191.41 [2019-03-28 12:23:07,057 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:07,064 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:07,064 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:07,064 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:15 251.16/191.41 [2019-03-28 12:23:07,087 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.41 [2019-03-28 12:23:07,087 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:07,092 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:07,092 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:07,092 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 251.16/191.41 [2019-03-28 12:23:07,114 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.41 [2019-03-28 12:23:07,115 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:07,116 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:07,116 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:07,116 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 251.16/191.41 [2019-03-28 12:23:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:07,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:07,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 251.16/191.41 [2019-03-28 12:23:07,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states 251.16/191.41 [2019-03-28 12:23:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. 251.16/191.41 [2019-03-28 12:23:07,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 251.16/191.41 [2019-03-28 12:23:07,162 INFO L87 Difference]: Start difference. First operand 232 states and 364 transitions. Second operand 22 states. 251.16/191.41 [2019-03-28 12:23:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:08,258 INFO L93 Difference]: Finished difference Result 256 states and 395 transitions. 251.16/191.41 [2019-03-28 12:23:08,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 251.16/191.41 [2019-03-28 12:23:08,259 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 251.16/191.41 [2019-03-28 12:23:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:08,260 INFO L225 Difference]: With dead ends: 256 251.16/191.41 [2019-03-28 12:23:08,260 INFO L226 Difference]: Without dead ends: 254 251.16/191.41 [2019-03-28 12:23:08,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 251.16/191.41 [2019-03-28 12:23:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. 251.16/191.41 [2019-03-28 12:23:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 153. 251.16/191.41 [2019-03-28 12:23:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. 251.16/191.41 [2019-03-28 12:23:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 239 transitions. 251.16/191.41 [2019-03-28 12:23:08,272 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 239 transitions. Word has length 23 251.16/191.41 [2019-03-28 12:23:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:08,272 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 239 transitions. 251.16/191.41 [2019-03-28 12:23:08,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. 251.16/191.41 [2019-03-28 12:23:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 239 transitions. 251.16/191.41 [2019-03-28 12:23:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 251.16/191.41 [2019-03-28 12:23:08,273 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:08,273 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:08,273 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1423514682, now seen corresponding path program 1 times 251.16/191.41 [2019-03-28 12:23:08,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:08,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:08,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:08,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:08,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:08,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:08,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 42 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:08,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:08,576 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:08,576 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,581 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:08,582 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,582 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:23:08,656 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:08,656 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 251.16/191.41 [2019-03-28 12:23:08,657 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,693 INFO L497 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size 251.16/191.41 [2019-03-28 12:23:08,693 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,694 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 251.16/191.41 [2019-03-28 12:23:08,733 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:08,734 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,755 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:08,760 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:08,760 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,782 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:08,783 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,783 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 251.16/191.41 [2019-03-28 12:23:08,858 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:08,859 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.41 [2019-03-28 12:23:08,859 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,873 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:08,890 INFO L340 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size 251.16/191.41 [2019-03-28 12:23:08,891 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 251.16/191.41 [2019-03-28 12:23:08,891 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,913 INFO L497 ElimStorePlain]: treesize reduction 8, result has 80.0 percent of original size 251.16/191.41 [2019-03-28 12:23:08,913 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,913 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 251.16/191.41 [2019-03-28 12:23:08,944 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:08,944 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 251.16/191.41 [2019-03-28 12:23:08,945 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,954 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:08,954 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:08,954 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 251.16/191.41 [2019-03-28 12:23:09,004 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:09,004 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 56 251.16/191.41 [2019-03-28 12:23:09,005 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:09,050 INFO L497 ElimStorePlain]: treesize reduction 28, result has 69.6 percent of original size 251.16/191.41 [2019-03-28 12:23:09,054 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.41 [2019-03-28 12:23:09,055 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:09,072 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:09,072 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:09,073 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:54 251.16/191.41 [2019-03-28 12:23:09,146 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_60|], 6=[|v_#memory_$Pointer$.base_68|]} 251.16/191.41 [2019-03-28 12:23:09,150 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 11 251.16/191.41 [2019-03-28 12:23:09,150 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:09,167 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:09,208 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:09,208 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 129 251.16/191.41 [2019-03-28 12:23:09,211 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:09,249 INFO L497 ElimStorePlain]: treesize reduction 102, result has 34.6 percent of original size 251.16/191.41 [2019-03-28 12:23:09,250 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:09,250 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:157, output treesize:67 251.16/191.41 [2019-03-28 12:23:09,292 INFO L388 ElimStorePlain]: Different consts {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} 251.16/191.41 [2019-03-28 12:23:09,295 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.41 [2019-03-28 12:23:09,296 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:09,308 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:09,316 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:09,316 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 40 251.16/191.41 [2019-03-28 12:23:09,317 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:09,332 INFO L497 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size 251.16/191.41 [2019-03-28 12:23:09,333 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:09,333 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:9 251.16/191.41 [2019-03-28 12:23:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:09,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:09,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 251.16/191.41 [2019-03-28 12:23:09,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states 251.16/191.41 [2019-03-28 12:23:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. 251.16/191.41 [2019-03-28 12:23:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 251.16/191.41 [2019-03-28 12:23:09,389 INFO L87 Difference]: Start difference. First operand 153 states and 239 transitions. Second operand 22 states. 251.16/191.41 [2019-03-28 12:23:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:11,002 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. 251.16/191.41 [2019-03-28 12:23:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 251.16/191.41 [2019-03-28 12:23:11,003 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 251.16/191.41 [2019-03-28 12:23:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:11,004 INFO L225 Difference]: With dead ends: 188 251.16/191.41 [2019-03-28 12:23:11,004 INFO L226 Difference]: Without dead ends: 182 251.16/191.41 [2019-03-28 12:23:11,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 251.16/191.41 [2019-03-28 12:23:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. 251.16/191.41 [2019-03-28 12:23:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 137. 251.16/191.41 [2019-03-28 12:23:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. 251.16/191.41 [2019-03-28 12:23:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. 251.16/191.41 [2019-03-28 12:23:11,014 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 23 251.16/191.41 [2019-03-28 12:23:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:11,014 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. 251.16/191.41 [2019-03-28 12:23:11,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. 251.16/191.41 [2019-03-28 12:23:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. 251.16/191.41 [2019-03-28 12:23:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 251.16/191.41 [2019-03-28 12:23:11,015 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:11,015 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:11,015 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1424994868, now seen corresponding path program 4 times 251.16/191.41 [2019-03-28 12:23:11,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:11,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:11,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:11,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:11,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:11,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 251.16/191.41 [2019-03-28 12:23:11,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 251.16/191.41 [2019-03-28 12:23:11,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:11,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 48 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:11,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:11,388 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:11,388 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,399 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,399 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,399 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 251.16/191.41 [2019-03-28 12:23:11,431 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:11,431 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,446 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,449 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:11,449 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,462 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,463 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,463 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:44 251.16/191.41 [2019-03-28 12:23:11,529 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:11,529 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 251.16/191.41 [2019-03-28 12:23:11,530 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,544 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,547 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:11,548 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 251.16/191.41 [2019-03-28 12:23:11,548 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,559 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,560 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,560 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:34 251.16/191.41 [2019-03-28 12:23:11,597 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,597 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 59 251.16/191.41 [2019-03-28 12:23:11,598 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,638 INFO L497 ElimStorePlain]: treesize reduction 26, result has 70.5 percent of original size 251.16/191.41 [2019-03-28 12:23:11,638 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,639 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:62 251.16/191.41 [2019-03-28 12:23:11,686 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:11,695 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,695 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 251.16/191.41 [2019-03-28 12:23:11,695 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,748 INFO L497 ElimStorePlain]: treesize reduction 16, result has 81.8 percent of original size 251.16/191.41 [2019-03-28 12:23:11,752 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:11,753 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 251.16/191.41 [2019-03-28 12:23:11,753 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,775 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,776 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,776 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:68 251.16/191.41 [2019-03-28 12:23:11,861 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_64|], 6=[|v_#memory_$Pointer$.base_72|]} 251.16/191.41 [2019-03-28 12:23:11,879 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,880 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 174 251.16/191.41 [2019-03-28 12:23:11,881 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:11,927 INFO L497 ElimStorePlain]: treesize reduction 52, result has 68.1 percent of original size 251.16/191.41 [2019-03-28 12:23:11,959 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:11,960 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 116 251.16/191.41 [2019-03-28 12:23:11,964 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:12,014 INFO L497 ElimStorePlain]: treesize reduction 64, result has 43.9 percent of original size 251.16/191.41 [2019-03-28 12:23:12,014 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:12,015 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:204, output treesize:72 251.16/191.41 [2019-03-28 12:23:12,060 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.41 [2019-03-28 12:23:12,060 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:12,075 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:12,076 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:12,076 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:72 251.16/191.41 [2019-03-28 12:23:12,124 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:12,124 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 35 251.16/191.41 [2019-03-28 12:23:12,125 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:12,151 INFO L497 ElimStorePlain]: treesize reduction 8, result has 76.5 percent of original size 251.16/191.41 [2019-03-28 12:23:12,152 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:12,152 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:21 251.16/191.41 [2019-03-28 12:23:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:12,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:12,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 251.16/191.41 [2019-03-28 12:23:12,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states 251.16/191.41 [2019-03-28 12:23:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. 251.16/191.41 [2019-03-28 12:23:12,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 251.16/191.41 [2019-03-28 12:23:12,221 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand 23 states. 251.16/191.41 [2019-03-28 12:23:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:13,899 INFO L93 Difference]: Finished difference Result 305 states and 464 transitions. 251.16/191.41 [2019-03-28 12:23:13,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 251.16/191.41 [2019-03-28 12:23:13,899 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 251.16/191.41 [2019-03-28 12:23:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:13,901 INFO L225 Difference]: With dead ends: 305 251.16/191.41 [2019-03-28 12:23:13,901 INFO L226 Difference]: Without dead ends: 303 251.16/191.41 [2019-03-28 12:23:13,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 251.16/191.41 [2019-03-28 12:23:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. 251.16/191.41 [2019-03-28 12:23:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 158. 251.16/191.41 [2019-03-28 12:23:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. 251.16/191.41 [2019-03-28 12:23:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 247 transitions. 251.16/191.41 [2019-03-28 12:23:13,914 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 247 transitions. Word has length 26 251.16/191.41 [2019-03-28 12:23:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:13,915 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 247 transitions. 251.16/191.41 [2019-03-28 12:23:13,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. 251.16/191.41 [2019-03-28 12:23:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. 251.16/191.41 [2019-03-28 12:23:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 251.16/191.41 [2019-03-28 12:23:13,915 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:13,916 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:13,916 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1424994870, now seen corresponding path program 3 times 251.16/191.41 [2019-03-28 12:23:13,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:13,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:13,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:13,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:13,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:14,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:14,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:14,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 251.16/191.41 [2019-03-28 12:23:14,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) 251.16/191.41 [2019-03-28 12:23:14,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:14,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 50 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:14,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:14,337 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:14,337 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,347 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,348 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,348 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 251.16/191.41 [2019-03-28 12:23:14,379 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:14,380 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,396 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,399 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:14,399 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,414 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,414 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,415 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:44 251.16/191.41 [2019-03-28 12:23:14,483 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:14,484 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 251.16/191.41 [2019-03-28 12:23:14,485 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,501 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,505 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:14,505 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 251.16/191.41 [2019-03-28 12:23:14,506 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,517 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,517 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,517 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:34 251.16/191.41 [2019-03-28 12:23:14,547 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,547 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 251.16/191.41 [2019-03-28 12:23:14,548 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,561 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,561 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,562 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:48 251.16/191.41 [2019-03-28 12:23:14,641 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:14,642 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 251.16/191.41 [2019-03-28 12:23:14,642 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,664 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,683 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,684 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 55 251.16/191.41 [2019-03-28 12:23:14,684 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,725 INFO L497 ElimStorePlain]: treesize reduction 28, result has 65.9 percent of original size 251.16/191.41 [2019-03-28 12:23:14,726 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,726 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:57 251.16/191.41 [2019-03-28 12:23:14,815 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:14,847 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,847 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 228 251.16/191.41 [2019-03-28 12:23:14,857 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:14,913 INFO L497 ElimStorePlain]: treesize reduction 134, result has 46.2 percent of original size 251.16/191.41 [2019-03-28 12:23:14,954 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:14,954 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 129 251.16/191.41 [2019-03-28 12:23:14,958 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:15,007 INFO L497 ElimStorePlain]: treesize reduction 76, result has 41.5 percent of original size 251.16/191.41 [2019-03-28 12:23:15,008 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:15,008 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:193, output treesize:79 251.16/191.41 [2019-03-28 12:23:15,057 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:15,057 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 48 251.16/191.41 [2019-03-28 12:23:15,058 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:15,076 INFO L497 ElimStorePlain]: treesize reduction 14, result has 72.0 percent of original size 251.16/191.41 [2019-03-28 12:23:15,076 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:15,077 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:36 251.16/191.41 [2019-03-28 12:23:15,162 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:15,167 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:15,167 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 251.16/191.41 [2019-03-28 12:23:15,169 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 251.16/191.41 [2019-03-28 12:23:15,187 INFO L497 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size 251.16/191.41 [2019-03-28 12:23:15,188 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:15,188 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:3 251.16/191.41 [2019-03-28 12:23:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:15,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:15,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 251.16/191.41 [2019-03-28 12:23:15,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states 251.16/191.41 [2019-03-28 12:23:15,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. 251.16/191.41 [2019-03-28 12:23:15,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 251.16/191.41 [2019-03-28 12:23:15,240 INFO L87 Difference]: Start difference. First operand 158 states and 247 transitions. Second operand 27 states. 251.16/191.41 [2019-03-28 12:23:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:17,432 INFO L93 Difference]: Finished difference Result 286 states and 423 transitions. 251.16/191.41 [2019-03-28 12:23:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 251.16/191.41 [2019-03-28 12:23:17,432 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 251.16/191.41 [2019-03-28 12:23:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:17,434 INFO L225 Difference]: With dead ends: 286 251.16/191.41 [2019-03-28 12:23:17,434 INFO L226 Difference]: Without dead ends: 284 251.16/191.41 [2019-03-28 12:23:17,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=392, Invalid=1500, Unknown=0, NotChecked=0, Total=1892 251.16/191.41 [2019-03-28 12:23:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. 251.16/191.41 [2019-03-28 12:23:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 172. 251.16/191.41 [2019-03-28 12:23:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. 251.16/191.41 [2019-03-28 12:23:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 266 transitions. 251.16/191.41 [2019-03-28 12:23:17,450 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 266 transitions. Word has length 26 251.16/191.41 [2019-03-28 12:23:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:17,450 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 266 transitions. 251.16/191.41 [2019-03-28 12:23:17,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. 251.16/191.41 [2019-03-28 12:23:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 266 transitions. 251.16/191.41 [2019-03-28 12:23:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 251.16/191.41 [2019-03-28 12:23:17,451 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:17,451 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:17,451 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:17,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:17,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1424994871, now seen corresponding path program 3 times 251.16/191.41 [2019-03-28 12:23:17,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:17,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:17,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:17,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:17,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:17,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:17,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:17,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 251.16/191.41 [2019-03-28 12:23:17,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) 251.16/191.41 [2019-03-28 12:23:17,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:17,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 55 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:17,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:17,958 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:17,959 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:17,970 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:17,970 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:17,970 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 251.16/191.41 [2019-03-28 12:23:18,005 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:18,006 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,022 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,025 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:18,025 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,040 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,040 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,041 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:44 251.16/191.41 [2019-03-28 12:23:18,126 INFO L340 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size 251.16/191.41 [2019-03-28 12:23:18,126 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 251.16/191.41 [2019-03-28 12:23:18,127 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,163 INFO L497 ElimStorePlain]: treesize reduction 8, result has 87.1 percent of original size 251.16/191.41 [2019-03-28 12:23:18,167 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:18,168 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.41 [2019-03-28 12:23:18,168 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,181 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,182 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,182 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 251.16/191.41 [2019-03-28 12:23:18,224 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:18,224 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 251.16/191.41 [2019-03-28 12:23:18,225 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,243 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,251 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,251 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 251.16/191.41 [2019-03-28 12:23:18,251 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,268 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,268 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,268 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 251.16/191.41 [2019-03-28 12:23:18,364 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:18,365 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.41 [2019-03-28 12:23:18,365 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,393 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,397 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:18,398 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.41 [2019-03-28 12:23:18,398 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,423 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,424 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,424 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 251.16/191.41 [2019-03-28 12:23:18,596 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,597 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 161 251.16/191.41 [2019-03-28 12:23:18,609 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,694 INFO L497 ElimStorePlain]: treesize reduction 76, result has 53.1 percent of original size 251.16/191.41 [2019-03-28 12:23:18,698 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:18,700 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:18,700 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 251.16/191.41 [2019-03-28 12:23:18,701 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,725 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,726 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,726 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:195, output treesize:105 251.16/191.41 [2019-03-28 12:23:18,901 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:18,917 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,917 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 86 251.16/191.41 [2019-03-28 12:23:18,921 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:18,986 INFO L497 ElimStorePlain]: treesize reduction 31, result has 70.5 percent of original size 251.16/191.41 [2019-03-28 12:23:18,991 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:18,996 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:18,996 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 251.16/191.41 [2019-03-28 12:23:18,997 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:19,038 INFO L497 ElimStorePlain]: treesize reduction 9, result has 84.2 percent of original size 251.16/191.41 [2019-03-28 12:23:19,039 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:19,039 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:138, output treesize:29 251.16/191.41 [2019-03-28 12:23:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:19,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:19,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 251.16/191.41 [2019-03-28 12:23:19,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states 251.16/191.41 [2019-03-28 12:23:19,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. 251.16/191.41 [2019-03-28 12:23:19,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 251.16/191.41 [2019-03-28 12:23:19,115 INFO L87 Difference]: Start difference. First operand 172 states and 266 transitions. Second operand 27 states. 251.16/191.41 [2019-03-28 12:23:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:21,699 INFO L93 Difference]: Finished difference Result 274 states and 416 transitions. 251.16/191.41 [2019-03-28 12:23:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 251.16/191.41 [2019-03-28 12:23:21,699 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 251.16/191.41 [2019-03-28 12:23:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:21,700 INFO L225 Difference]: With dead ends: 274 251.16/191.41 [2019-03-28 12:23:21,700 INFO L226 Difference]: Without dead ends: 268 251.16/191.41 [2019-03-28 12:23:21,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 251.16/191.41 [2019-03-28 12:23:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. 251.16/191.41 [2019-03-28 12:23:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 165. 251.16/191.41 [2019-03-28 12:23:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. 251.16/191.41 [2019-03-28 12:23:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 256 transitions. 251.16/191.41 [2019-03-28 12:23:21,714 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 256 transitions. Word has length 26 251.16/191.41 [2019-03-28 12:23:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:21,715 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 256 transitions. 251.16/191.41 [2019-03-28 12:23:21,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. 251.16/191.41 [2019-03-28 12:23:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 256 transitions. 251.16/191.41 [2019-03-28 12:23:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 251.16/191.41 [2019-03-28 12:23:21,715 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:21,715 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:21,716 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:21,716 INFO L82 PathProgramCache]: Analyzing trace with hash 626033236, now seen corresponding path program 2 times 251.16/191.41 [2019-03-28 12:23:21,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:21,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:21,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:21,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:21,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:22,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:22,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:22,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 251.16/191.41 [2019-03-28 12:23:22,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 251.16/191.41 [2019-03-28 12:23:22,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:22,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 50 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:22,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:22,132 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:22,132 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,135 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,135 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,136 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:23:22,204 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:22,204 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 251.16/191.41 [2019-03-28 12:23:22,205 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,216 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,217 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,217 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 251.16/191.41 [2019-03-28 12:23:22,254 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:22,254 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,272 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,275 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:22,275 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,292 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,293 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,293 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:47 251.16/191.41 [2019-03-28 12:23:22,378 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:22,379 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 251.16/191.41 [2019-03-28 12:23:22,379 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,402 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,405 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:22,406 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 251.16/191.41 [2019-03-28 12:23:22,406 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,421 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,422 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,422 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:50 251.16/191.41 [2019-03-28 12:23:22,470 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:22,472 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:22,484 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,485 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 47 251.16/191.41 [2019-03-28 12:23:22,485 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,533 INFO L497 ElimStorePlain]: treesize reduction 14, result has 81.6 percent of original size 251.16/191.41 [2019-03-28 12:23:22,534 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,534 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:62 251.16/191.41 [2019-03-28 12:23:22,596 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:22,596 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 251.16/191.41 [2019-03-28 12:23:22,597 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,627 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,632 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:22,633 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 251.16/191.41 [2019-03-28 12:23:22,633 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,663 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,664 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,664 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:80 251.16/191.41 [2019-03-28 12:23:22,796 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_76|], 6=[|v_#memory_$Pointer$.base_84|]} 251.16/191.41 [2019-03-28 12:23:22,801 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 14 251.16/191.41 [2019-03-28 12:23:22,801 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,831 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,835 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:22,872 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:22,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 124 251.16/191.41 [2019-03-28 12:23:22,884 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,959 INFO L497 ElimStorePlain]: treesize reduction 70, result has 48.1 percent of original size 251.16/191.41 [2019-03-28 12:23:22,960 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:22,960 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:177, output treesize:87 251.16/191.41 [2019-03-28 12:23:23,025 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 251.16/191.41 [2019-03-28 12:23:23,025 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:23,048 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:23,049 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:23,049 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:98, output treesize:83 251.16/191.41 [2019-03-28 12:23:23,117 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:23,118 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:23,131 INFO L340 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size 251.16/191.41 [2019-03-28 12:23:23,131 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 38 251.16/191.41 [2019-03-28 12:23:23,132 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:23,169 INFO L497 ElimStorePlain]: treesize reduction 8, result has 82.6 percent of original size 251.16/191.41 [2019-03-28 12:23:23,170 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:23,171 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:89, output treesize:29 251.16/191.41 [2019-03-28 12:23:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:23,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:23,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 251.16/191.41 [2019-03-28 12:23:23,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states 251.16/191.41 [2019-03-28 12:23:23,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. 251.16/191.41 [2019-03-28 12:23:23,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 251.16/191.41 [2019-03-28 12:23:23,251 INFO L87 Difference]: Start difference. First operand 165 states and 256 transitions. Second operand 27 states. 251.16/191.41 [2019-03-28 12:23:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:26,100 INFO L93 Difference]: Finished difference Result 380 states and 583 transitions. 251.16/191.41 [2019-03-28 12:23:26,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 251.16/191.41 [2019-03-28 12:23:26,100 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 251.16/191.41 [2019-03-28 12:23:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:26,102 INFO L225 Difference]: With dead ends: 380 251.16/191.41 [2019-03-28 12:23:26,102 INFO L226 Difference]: Without dead ends: 325 251.16/191.41 [2019-03-28 12:23:26,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 251.16/191.41 [2019-03-28 12:23:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. 251.16/191.41 [2019-03-28 12:23:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 177. 251.16/191.41 [2019-03-28 12:23:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. 251.16/191.41 [2019-03-28 12:23:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 275 transitions. 251.16/191.41 [2019-03-28 12:23:26,117 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 275 transitions. Word has length 26 251.16/191.41 [2019-03-28 12:23:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:26,118 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 275 transitions. 251.16/191.41 [2019-03-28 12:23:26,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. 251.16/191.41 [2019-03-28 12:23:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 275 transitions. 251.16/191.41 [2019-03-28 12:23:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 251.16/191.41 [2019-03-28 12:23:26,118 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:26,118 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:26,119 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 626033238, now seen corresponding path program 2 times 251.16/191.41 [2019-03-28 12:23:26,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:26,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:26,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:26,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:26,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:26,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 251.16/191.41 [2019-03-28 12:23:26,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 251.16/191.41 [2019-03-28 12:23:26,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:26,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 50 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:26,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:26,601 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:26,601 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,605 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:26,605 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,605 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:23:26,672 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:26,673 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 251.16/191.41 [2019-03-28 12:23:26,673 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,685 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:26,685 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,686 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 251.16/191.41 [2019-03-28 12:23:26,723 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:26,724 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,743 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:26,746 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:26,747 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,763 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:26,764 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,764 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:47 251.16/191.41 [2019-03-28 12:23:26,848 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:26,849 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 251.16/191.41 [2019-03-28 12:23:26,850 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,869 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:26,872 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:26,873 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 251.16/191.41 [2019-03-28 12:23:26,873 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,887 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:26,887 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,887 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:53 251.16/191.41 [2019-03-28 12:23:26,920 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:26,921 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:26,926 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:26,926 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 251.16/191.41 [2019-03-28 12:23:26,926 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,941 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:26,942 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:26,942 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:53 251.16/191.41 [2019-03-28 12:23:26,994 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:26,995 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 251.16/191.41 [2019-03-28 12:23:26,996 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,021 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:27,042 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:27,043 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 59 251.16/191.41 [2019-03-28 12:23:27,043 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,092 INFO L497 ElimStorePlain]: treesize reduction 34, result has 63.4 percent of original size 251.16/191.41 [2019-03-28 12:23:27,093 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,093 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:59 251.16/191.41 [2019-03-28 12:23:27,203 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:27,236 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:27,236 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 224 251.16/191.41 [2019-03-28 12:23:27,243 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,309 INFO L497 ElimStorePlain]: treesize reduction 134, result has 45.5 percent of original size 251.16/191.41 [2019-03-28 12:23:27,353 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:27,353 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 129 251.16/191.41 [2019-03-28 12:23:27,355 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,409 INFO L497 ElimStorePlain]: treesize reduction 202, result has 25.2 percent of original size 251.16/191.41 [2019-03-28 12:23:27,409 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,410 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:73 251.16/191.41 [2019-03-28 12:23:27,466 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:27,467 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 48 251.16/191.41 [2019-03-28 12:23:27,468 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,489 INFO L497 ElimStorePlain]: treesize reduction 23, result has 59.6 percent of original size 251.16/191.41 [2019-03-28 12:23:27,489 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,490 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:34 251.16/191.41 [2019-03-28 12:23:27,582 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:27,586 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:27,587 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 251.16/191.41 [2019-03-28 12:23:27,588 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,608 INFO L497 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size 251.16/191.41 [2019-03-28 12:23:27,608 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:27,608 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:3 251.16/191.41 [2019-03-28 12:23:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:27,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:27,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 251.16/191.41 [2019-03-28 12:23:27,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states 251.16/191.41 [2019-03-28 12:23:27,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. 251.16/191.41 [2019-03-28 12:23:27,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 251.16/191.41 [2019-03-28 12:23:27,663 INFO L87 Difference]: Start difference. First operand 177 states and 275 transitions. Second operand 28 states. 251.16/191.41 [2019-03-28 12:23:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:31,097 INFO L93 Difference]: Finished difference Result 316 states and 462 transitions. 251.16/191.41 [2019-03-28 12:23:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 251.16/191.41 [2019-03-28 12:23:31,098 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 26 251.16/191.41 [2019-03-28 12:23:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:31,099 INFO L225 Difference]: With dead ends: 316 251.16/191.41 [2019-03-28 12:23:31,099 INFO L226 Difference]: Without dead ends: 314 251.16/191.41 [2019-03-28 12:23:31,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 251.16/191.41 [2019-03-28 12:23:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. 251.16/191.41 [2019-03-28 12:23:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 176. 251.16/191.41 [2019-03-28 12:23:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. 251.16/191.41 [2019-03-28 12:23:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 271 transitions. 251.16/191.41 [2019-03-28 12:23:31,116 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 271 transitions. Word has length 26 251.16/191.41 [2019-03-28 12:23:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:31,116 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 271 transitions. 251.16/191.41 [2019-03-28 12:23:31,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. 251.16/191.41 [2019-03-28 12:23:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 271 transitions. 251.16/191.41 [2019-03-28 12:23:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 251.16/191.41 [2019-03-28 12:23:31,117 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:31,117 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:31,117 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:31,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:31,117 INFO L82 PathProgramCache]: Analyzing trace with hash 626033239, now seen corresponding path program 2 times 251.16/191.41 [2019-03-28 12:23:31,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:31,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:31,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:31,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:31,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:31,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:31,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 251.16/191.41 [2019-03-28 12:23:31,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 251.16/191.41 [2019-03-28 12:23:31,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:31,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 53 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:31,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:31,590 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:31,591 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,594 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:31,595 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,595 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:23:31,668 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:31,669 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 251.16/191.41 [2019-03-28 12:23:31,669 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,681 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:31,681 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,681 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 251.16/191.41 [2019-03-28 12:23:31,719 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:31,720 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,738 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:31,741 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:31,741 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,758 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:31,758 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,758 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:47 251.16/191.41 [2019-03-28 12:23:31,846 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:31,847 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 251.16/191.41 [2019-03-28 12:23:31,847 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,868 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:31,871 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:31,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 251.16/191.41 [2019-03-28 12:23:31,872 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,888 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:31,888 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,889 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:50 251.16/191.41 [2019-03-28 12:23:31,936 INFO L388 ElimStorePlain]: Different consts {0=[|v_#length_41|], 3=[|v_#valid_81|]} 251.16/191.41 [2019-03-28 12:23:31,940 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:31,941 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:31,965 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:31,970 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:31,972 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:31,975 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:31,976 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 251.16/191.41 [2019-03-28 12:23:31,976 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,000 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:32,000 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,000 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:55 251.16/191.41 [2019-03-28 12:23:32,058 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:32,059 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 251.16/191.41 [2019-03-28 12:23:32,060 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,090 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:32,094 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:32,095 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 251.16/191.41 [2019-03-28 12:23:32,095 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,121 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:32,121 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,122 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:79 251.16/191.41 [2019-03-28 12:23:32,242 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:32,276 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:32,277 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 143 251.16/191.41 [2019-03-28 12:23:32,288 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,366 INFO L497 ElimStorePlain]: treesize reduction 70, result has 53.0 percent of original size 251.16/191.41 [2019-03-28 12:23:32,370 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:32,371 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:32,372 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 251.16/191.41 [2019-03-28 12:23:32,372 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,396 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:32,396 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,397 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:176, output treesize:86 251.16/191.41 [2019-03-28 12:23:32,515 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:32,516 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:32,527 INFO L340 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size 251.16/191.41 [2019-03-28 12:23:32,527 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 55 251.16/191.41 [2019-03-28 12:23:32,528 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,570 INFO L497 ElimStorePlain]: treesize reduction 8, result has 87.9 percent of original size 251.16/191.41 [2019-03-28 12:23:32,573 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:32,577 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:32,578 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 251.16/191.41 [2019-03-28 12:23:32,579 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,608 INFO L497 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size 251.16/191.41 [2019-03-28 12:23:32,609 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:32,609 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:12 251.16/191.41 [2019-03-28 12:23:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:32,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:32,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 251.16/191.41 [2019-03-28 12:23:32,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states 251.16/191.41 [2019-03-28 12:23:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. 251.16/191.41 [2019-03-28 12:23:32,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 251.16/191.41 [2019-03-28 12:23:32,677 INFO L87 Difference]: Start difference. First operand 176 states and 271 transitions. Second operand 28 states. 251.16/191.41 [2019-03-28 12:23:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:36,769 INFO L93 Difference]: Finished difference Result 304 states and 453 transitions. 251.16/191.41 [2019-03-28 12:23:36,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 251.16/191.41 [2019-03-28 12:23:36,770 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 26 251.16/191.41 [2019-03-28 12:23:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:36,771 INFO L225 Difference]: With dead ends: 304 251.16/191.41 [2019-03-28 12:23:36,771 INFO L226 Difference]: Without dead ends: 297 251.16/191.41 [2019-03-28 12:23:36,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=333, Invalid=2019, Unknown=0, NotChecked=0, Total=2352 251.16/191.41 [2019-03-28 12:23:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. 251.16/191.41 [2019-03-28 12:23:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 162. 251.16/191.41 [2019-03-28 12:23:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. 251.16/191.41 [2019-03-28 12:23:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. 251.16/191.41 [2019-03-28 12:23:36,786 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 26 251.16/191.41 [2019-03-28 12:23:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:36,786 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. 251.16/191.41 [2019-03-28 12:23:36,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. 251.16/191.41 [2019-03-28 12:23:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. 251.16/191.41 [2019-03-28 12:23:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 251.16/191.41 [2019-03-28 12:23:36,787 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:36,787 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:36,787 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -585207722, now seen corresponding path program 3 times 251.16/191.41 [2019-03-28 12:23:36,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:36,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:36,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:36,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:36,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:37,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:37,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:37,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 251.16/191.41 [2019-03-28 12:23:37,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) 251.16/191.41 [2019-03-28 12:23:37,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:37,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 55 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:37,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:37,291 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:37,291 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,295 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,295 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,296 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:23:37,301 INFO L388 ElimStorePlain]: Different consts {0=[|v_#length_42|], 3=[|v_#valid_83|]} 251.16/191.41 [2019-03-28 12:23:37,305 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:37,306 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,320 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,337 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,337 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 251.16/191.41 [2019-03-28 12:23:37,338 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,367 INFO L497 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size 251.16/191.41 [2019-03-28 12:23:37,367 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,368 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 251.16/191.41 [2019-03-28 12:23:37,410 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:37,410 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,427 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,430 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:37,430 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,445 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,446 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,446 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 251.16/191.41 [2019-03-28 12:23:37,482 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.41 [2019-03-28 12:23:37,482 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,494 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,494 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,494 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45 251.16/191.41 [2019-03-28 12:23:37,529 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 251.16/191.41 [2019-03-28 12:23:37,529 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,540 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,540 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,540 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:33 251.16/191.41 [2019-03-28 12:23:37,562 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_43|], 6=[|v_#valid_84|]} 251.16/191.41 [2019-03-28 12:23:37,566 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:37,567 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 251.16/191.41 [2019-03-28 12:23:37,567 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,585 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,614 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,614 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 251.16/191.41 [2019-03-28 12:23:37,615 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,660 INFO L497 ElimStorePlain]: treesize reduction 40, result has 62.6 percent of original size 251.16/191.41 [2019-03-28 12:23:37,660 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,660 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:67 251.16/191.41 [2019-03-28 12:23:37,706 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:37,715 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,715 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 251.16/191.41 [2019-03-28 12:23:37,716 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,757 INFO L497 ElimStorePlain]: treesize reduction 20, result has 73.7 percent of original size 251.16/191.41 [2019-03-28 12:23:37,757 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,758 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:71 251.16/191.41 [2019-03-28 12:23:37,875 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:37,876 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 124 251.16/191.41 [2019-03-28 12:23:37,881 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,924 INFO L497 ElimStorePlain]: treesize reduction 64, result has 44.3 percent of original size 251.16/191.41 [2019-03-28 12:23:37,925 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:37,925 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:120, output treesize:81 251.16/191.41 [2019-03-28 12:23:38,053 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 12 251.16/191.41 [2019-03-28 12:23:38,053 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:38,067 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:38,070 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.41 [2019-03-28 12:23:38,081 INFO L340 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size 251.16/191.41 [2019-03-28 12:23:38,081 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 36 251.16/191.41 [2019-03-28 12:23:38,082 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:38,110 INFO L497 ElimStorePlain]: treesize reduction 4, result has 89.5 percent of original size 251.16/191.41 [2019-03-28 12:23:38,110 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:38,111 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:105, output treesize:28 251.16/191.41 [2019-03-28 12:23:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:38,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:38,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 251.16/191.41 [2019-03-28 12:23:38,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states 251.16/191.41 [2019-03-28 12:23:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. 251.16/191.41 [2019-03-28 12:23:38,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 251.16/191.41 [2019-03-28 12:23:38,193 INFO L87 Difference]: Start difference. First operand 162 states and 252 transitions. Second operand 24 states. 251.16/191.41 [2019-03-28 12:23:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:39,843 INFO L93 Difference]: Finished difference Result 212 states and 321 transitions. 251.16/191.41 [2019-03-28 12:23:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 251.16/191.41 [2019-03-28 12:23:39,844 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 251.16/191.41 [2019-03-28 12:23:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:39,845 INFO L225 Difference]: With dead ends: 212 251.16/191.41 [2019-03-28 12:23:39,845 INFO L226 Difference]: Without dead ends: 210 251.16/191.41 [2019-03-28 12:23:39,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 251.16/191.41 [2019-03-28 12:23:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. 251.16/191.41 [2019-03-28 12:23:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 176. 251.16/191.41 [2019-03-28 12:23:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. 251.16/191.41 [2019-03-28 12:23:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 274 transitions. 251.16/191.41 [2019-03-28 12:23:39,862 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 274 transitions. Word has length 26 251.16/191.41 [2019-03-28 12:23:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:39,862 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 274 transitions. 251.16/191.41 [2019-03-28 12:23:39,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. 251.16/191.41 [2019-03-28 12:23:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 274 transitions. 251.16/191.41 [2019-03-28 12:23:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 251.16/191.41 [2019-03-28 12:23:39,863 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:39,863 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:39,863 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:39,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash -585207720, now seen corresponding path program 2 times 251.16/191.41 [2019-03-28 12:23:39,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:39,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:39,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:39,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:40,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.41 [2019-03-28 12:23:40,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.41 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.41 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.41 [2019-03-28 12:23:40,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 251.16/191.41 [2019-03-28 12:23:40,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 251.16/191.41 [2019-03-28 12:23:40,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:40,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 48 conjunts are in the unsatisfiable core 251.16/191.41 [2019-03-28 12:23:40,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.41 [2019-03-28 12:23:40,289 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.41 [2019-03-28 12:23:40,289 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,293 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,293 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,293 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.41 [2019-03-28 12:23:40,314 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,314 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 251.16/191.41 [2019-03-28 12:23:40,315 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,340 INFO L497 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size 251.16/191.41 [2019-03-28 12:23:40,341 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,341 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 251.16/191.41 [2019-03-28 12:23:40,374 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:40,375 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,392 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,396 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.41 [2019-03-28 12:23:40,396 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,412 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,413 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,413 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 251.16/191.41 [2019-03-28 12:23:40,483 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:40,484 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 251.16/191.41 [2019-03-28 12:23:40,484 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,502 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,505 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:40,528 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 251.16/191.41 [2019-03-28 12:23:40,528 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,541 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,541 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,542 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:42 251.16/191.41 [2019-03-28 12:23:40,563 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,563 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 251.16/191.41 [2019-03-28 12:23:40,564 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,576 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,576 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,577 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:36 251.16/191.41 [2019-03-28 12:23:40,611 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.41 [2019-03-28 12:23:40,612 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,630 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,633 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.41 [2019-03-28 12:23:40,633 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,663 INFO L497 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size 251.16/191.41 [2019-03-28 12:23:40,664 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,664 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:50 251.16/191.41 [2019-03-28 12:23:40,765 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,766 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 126 251.16/191.41 [2019-03-28 12:23:40,776 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,830 INFO L497 ElimStorePlain]: treesize reduction 64, result has 46.2 percent of original size 251.16/191.41 [2019-03-28 12:23:40,833 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.41 [2019-03-28 12:23:40,834 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 251.16/191.41 [2019-03-28 12:23:40,835 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,847 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,847 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,847 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:128, output treesize:50 251.16/191.41 [2019-03-28 12:23:40,887 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,887 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 30 251.16/191.41 [2019-03-28 12:23:40,888 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,895 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,896 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,896 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:26 251.16/191.41 [2019-03-28 12:23:40,935 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,935 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 251.16/191.41 [2019-03-28 12:23:40,935 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,939 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.41 [2019-03-28 12:23:40,939 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.41 [2019-03-28 12:23:40,939 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 251.16/191.41 [2019-03-28 12:23:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:40,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.41 [2019-03-28 12:23:40,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 251.16/191.41 [2019-03-28 12:23:40,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states 251.16/191.41 [2019-03-28 12:23:40,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. 251.16/191.41 [2019-03-28 12:23:40,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 251.16/191.41 [2019-03-28 12:23:40,987 INFO L87 Difference]: Start difference. First operand 176 states and 274 transitions. Second operand 23 states. 251.16/191.41 [2019-03-28 12:23:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.41 [2019-03-28 12:23:42,303 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. 251.16/191.41 [2019-03-28 12:23:42,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 251.16/191.41 [2019-03-28 12:23:42,304 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 251.16/191.41 [2019-03-28 12:23:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.41 [2019-03-28 12:23:42,305 INFO L225 Difference]: With dead ends: 214 251.16/191.41 [2019-03-28 12:23:42,305 INFO L226 Difference]: Without dead ends: 212 251.16/191.41 [2019-03-28 12:23:42,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 251.16/191.41 [2019-03-28 12:23:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. 251.16/191.41 [2019-03-28 12:23:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. 251.16/191.41 [2019-03-28 12:23:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. 251.16/191.41 [2019-03-28 12:23:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 270 transitions. 251.16/191.41 [2019-03-28 12:23:42,322 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 270 transitions. Word has length 26 251.16/191.41 [2019-03-28 12:23:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.41 [2019-03-28 12:23:42,322 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 270 transitions. 251.16/191.41 [2019-03-28 12:23:42,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. 251.16/191.41 [2019-03-28 12:23:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 270 transitions. 251.16/191.41 [2019-03-28 12:23:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 251.16/191.41 [2019-03-28 12:23:42,323 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.41 [2019-03-28 12:23:42,323 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.41 [2019-03-28 12:23:42,323 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.41 [2019-03-28 12:23:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.41 [2019-03-28 12:23:42,324 INFO L82 PathProgramCache]: Analyzing trace with hash -585207719, now seen corresponding path program 2 times 251.16/191.41 [2019-03-28 12:23:42,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.41 [2019-03-28 12:23:42,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.41 [2019-03-28 12:23:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:42,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:42,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.41 [2019-03-28 12:23:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.41 [2019-03-28 12:23:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.41 [2019-03-28 12:23:42,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.42 [2019-03-28 12:23:42,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.42 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.42 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.42 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.42 [2019-03-28 12:23:42,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 251.16/191.42 [2019-03-28 12:23:42,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 251.16/191.42 [2019-03-28 12:23:42,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:23:42,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core 251.16/191.42 [2019-03-28 12:23:42,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.42 [2019-03-28 12:23:42,808 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.42 [2019-03-28 12:23:42,808 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:42,812 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:42,812 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:42,812 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.42 [2019-03-28 12:23:42,817 INFO L388 ElimStorePlain]: Different consts {0=[|v_#length_44|], 3=[|v_#valid_89|]} 251.16/191.42 [2019-03-28 12:23:42,820 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.42 [2019-03-28 12:23:42,820 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:42,833 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:42,848 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:42,848 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 251.16/191.42 [2019-03-28 12:23:42,849 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:42,876 INFO L497 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size 251.16/191.42 [2019-03-28 12:23:42,876 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:42,876 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 251.16/191.42 [2019-03-28 12:23:42,914 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:23:42,914 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:42,932 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:42,936 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:23:42,936 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:42,952 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:42,953 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:42,953 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:56 251.16/191.42 [2019-03-28 12:23:42,994 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.42 [2019-03-28 12:23:42,995 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,006 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,006 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,007 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45 251.16/191.42 [2019-03-28 12:23:43,043 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:23:43,044 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 251.16/191.42 [2019-03-28 12:23:43,044 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,056 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,056 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,057 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:36 251.16/191.42 [2019-03-28 12:23:43,092 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_45|], 3=[|v_#valid_90|]} 251.16/191.42 [2019-03-28 12:23:43,096 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:23:43,097 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 251.16/191.42 [2019-03-28 12:23:43,097 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,116 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,127 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,128 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 251.16/191.42 [2019-03-28 12:23:43,128 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,143 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,144 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,144 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 251.16/191.42 [2019-03-28 12:23:43,183 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_$Pointer$.offset_91|], 2=[|v_#memory_$Pointer$.base_103|]} 251.16/191.42 [2019-03-28 12:23:43,186 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:23:43,187 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,209 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,212 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.42 [2019-03-28 12:23:43,213 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,250 INFO L497 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size 251.16/191.42 [2019-03-28 12:23:43,250 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,251 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:62 251.16/191.42 [2019-03-28 12:23:43,334 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_92|], 6=[|v_#memory_$Pointer$.base_104|]} 251.16/191.42 [2019-03-28 12:23:43,337 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 17 251.16/191.42 [2019-03-28 12:23:43,338 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,357 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,359 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:23:43,393 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,393 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 131 251.16/191.42 [2019-03-28 12:23:43,402 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,448 INFO L497 ElimStorePlain]: treesize reduction 70, result has 43.1 percent of original size 251.16/191.42 [2019-03-28 12:23:43,449 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,449 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:169, output treesize:79 251.16/191.42 [2019-03-28 12:23:43,585 INFO L388 ElimStorePlain]: Different consts {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} 251.16/191.42 [2019-03-28 12:23:43,588 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:23:43,589 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 251.16/191.42 [2019-03-28 12:23:43,589 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,608 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,611 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:23:43,626 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:43,627 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 251.16/191.42 [2019-03-28 12:23:43,630 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,671 INFO L497 ElimStorePlain]: treesize reduction 27, result has 62.5 percent of original size 251.16/191.42 [2019-03-28 12:23:43,673 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:43,673 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:23 251.16/191.42 [2019-03-28 12:23:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:23:43,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.42 [2019-03-28 12:23:43,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 251.16/191.42 [2019-03-28 12:23:43,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states 251.16/191.42 [2019-03-28 12:23:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. 251.16/191.42 [2019-03-28 12:23:43,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 251.16/191.42 [2019-03-28 12:23:43,744 INFO L87 Difference]: Start difference. First operand 175 states and 270 transitions. Second operand 25 states. 251.16/191.42 [2019-03-28 12:23:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.42 [2019-03-28 12:23:45,707 INFO L93 Difference]: Finished difference Result 210 states and 315 transitions. 251.16/191.42 [2019-03-28 12:23:45,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 251.16/191.42 [2019-03-28 12:23:45,707 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 251.16/191.42 [2019-03-28 12:23:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.42 [2019-03-28 12:23:45,708 INFO L225 Difference]: With dead ends: 210 251.16/191.42 [2019-03-28 12:23:45,709 INFO L226 Difference]: Without dead ends: 204 251.16/191.42 [2019-03-28 12:23:45,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 251.16/191.42 [2019-03-28 12:23:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. 251.16/191.42 [2019-03-28 12:23:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 153. 251.16/191.42 [2019-03-28 12:23:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. 251.16/191.42 [2019-03-28 12:23:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 237 transitions. 251.16/191.42 [2019-03-28 12:23:45,722 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 237 transitions. Word has length 26 251.16/191.42 [2019-03-28 12:23:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.42 [2019-03-28 12:23:45,723 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 237 transitions. 251.16/191.42 [2019-03-28 12:23:45,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. 251.16/191.42 [2019-03-28 12:23:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 237 transitions. 251.16/191.42 [2019-03-28 12:23:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 251.16/191.42 [2019-03-28 12:23:45,723 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.42 [2019-03-28 12:23:45,724 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.42 [2019-03-28 12:23:45,724 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.42 [2019-03-28 12:23:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.42 [2019-03-28 12:23:45,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2120471747, now seen corresponding path program 5 times 251.16/191.42 [2019-03-28 12:23:45,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.42 [2019-03-28 12:23:45,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.42 [2019-03-28 12:23:45,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:23:45,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:23:45,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:23:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:23:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:23:46,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.42 [2019-03-28 12:23:46,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.42 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.42 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.42 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.42 [2019-03-28 12:23:46,065 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 251.16/191.42 [2019-03-28 12:23:46,144 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) 251.16/191.42 [2019-03-28 12:23:46,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:23:46,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 50 conjunts are in the unsatisfiable core 251.16/191.42 [2019-03-28 12:23:46,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.42 [2019-03-28 12:23:46,205 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:46,205 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 251.16/191.42 [2019-03-28 12:23:46,206 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,227 INFO L497 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size 251.16/191.42 [2019-03-28 12:23:46,227 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,227 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 251.16/191.42 [2019-03-28 12:23:46,254 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:23:46,254 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,265 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:46,265 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,265 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 251.16/191.42 [2019-03-28 12:23:46,339 INFO L340 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size 251.16/191.42 [2019-03-28 12:23:46,339 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 251.16/191.42 [2019-03-28 12:23:46,340 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,358 INFO L497 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size 251.16/191.42 [2019-03-28 12:23:46,358 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,358 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:27 251.16/191.42 [2019-03-28 12:23:46,407 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:46,407 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 251.16/191.42 [2019-03-28 12:23:46,408 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,442 INFO L497 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size 251.16/191.42 [2019-03-28 12:23:46,443 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,443 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:58 251.16/191.42 [2019-03-28 12:23:46,493 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:46,494 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 69 251.16/191.42 [2019-03-28 12:23:46,494 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,528 INFO L497 ElimStorePlain]: treesize reduction 34, result has 59.0 percent of original size 251.16/191.42 [2019-03-28 12:23:46,529 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,529 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:58 251.16/191.42 [2019-03-28 12:23:46,658 INFO L340 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size 251.16/191.42 [2019-03-28 12:23:46,658 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 83 251.16/191.42 [2019-03-28 12:23:46,660 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,698 INFO L497 ElimStorePlain]: treesize reduction 36, result has 57.6 percent of original size 251.16/191.42 [2019-03-28 12:23:46,698 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,699 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:120, output treesize:64 251.16/191.42 [2019-03-28 12:23:46,732 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:23:46,754 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:46,754 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 130 251.16/191.42 [2019-03-28 12:23:46,755 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,803 INFO L497 ElimStorePlain]: treesize reduction 82, result has 56.8 percent of original size 251.16/191.42 [2019-03-28 12:23:46,804 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,804 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:109, output treesize:108 251.16/191.42 [2019-03-28 12:23:46,892 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:46,892 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 140 251.16/191.42 [2019-03-28 12:23:46,897 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,954 INFO L497 ElimStorePlain]: treesize reduction 84, result has 44.0 percent of original size 251.16/191.42 [2019-03-28 12:23:46,955 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:46,955 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:84 251.16/191.42 [2019-03-28 12:23:47,148 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:47,148 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 228 251.16/191.42 [2019-03-28 12:23:47,295 INFO L427 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:47,411 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 251.16/191.42 [2019-03-28 12:23:47,411 INFO L497 ElimStorePlain]: treesize reduction 130, result has 39.8 percent of original size 251.16/191.42 [2019-03-28 12:23:47,415 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:47,416 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:198, output treesize:224 251.16/191.42 [2019-03-28 12:23:47,642 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 251.16/191.42 [2019-03-28 12:23:47,643 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:47,654 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:47,655 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 56 251.16/191.42 [2019-03-28 12:23:47,656 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:47,681 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:23:47,682 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 96 251.16/191.42 [2019-03-28 12:23:47,685 INFO L427 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:23:47,793 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 251.16/191.42 [2019-03-28 12:23:47,793 INFO L497 ElimStorePlain]: treesize reduction 72, result has 58.1 percent of original size 251.16/191.42 [2019-03-28 12:23:47,794 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. 251.16/191.42 [2019-03-28 12:23:47,794 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:341, output treesize:100 251.16/191.42 [2019-03-28 12:23:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:23:47,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.42 [2019-03-28 12:23:47,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 251.16/191.42 [2019-03-28 12:23:47,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states 251.16/191.42 [2019-03-28 12:23:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. 251.16/191.42 [2019-03-28 12:23:47,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 251.16/191.42 [2019-03-28 12:23:47,917 INFO L87 Difference]: Start difference. First operand 153 states and 237 transitions. Second operand 31 states. 251.16/191.42 [2019-03-28 12:23:52,261 WARN L188 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 251.16/191.42 [2019-03-28 12:23:58,803 WARN L188 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 65 DAG size of output: 46 251.16/191.42 [2019-03-28 12:24:07,299 WARN L188 SmtUtils]: Spent 8.43 s on a formula simplification. DAG size of input: 43 DAG size of output: 41 251.16/191.42 [2019-03-28 12:24:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.42 [2019-03-28 12:24:07,708 INFO L93 Difference]: Finished difference Result 613 states and 931 transitions. 251.16/191.42 [2019-03-28 12:24:07,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. 251.16/191.42 [2019-03-28 12:24:07,708 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 29 251.16/191.42 [2019-03-28 12:24:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.42 [2019-03-28 12:24:07,711 INFO L225 Difference]: With dead ends: 613 251.16/191.42 [2019-03-28 12:24:07,711 INFO L226 Difference]: Without dead ends: 577 251.16/191.42 [2019-03-28 12:24:07,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=746, Invalid=3946, Unknown=0, NotChecked=0, Total=4692 251.16/191.42 [2019-03-28 12:24:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. 251.16/191.42 [2019-03-28 12:24:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 294. 251.16/191.42 [2019-03-28 12:24:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. 251.16/191.42 [2019-03-28 12:24:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 455 transitions. 251.16/191.42 [2019-03-28 12:24:07,737 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 455 transitions. Word has length 29 251.16/191.42 [2019-03-28 12:24:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.42 [2019-03-28 12:24:07,737 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 455 transitions. 251.16/191.42 [2019-03-28 12:24:07,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. 251.16/191.42 [2019-03-28 12:24:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 455 transitions. 251.16/191.42 [2019-03-28 12:24:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 251.16/191.42 [2019-03-28 12:24:07,739 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.42 [2019-03-28 12:24:07,739 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.42 [2019-03-28 12:24:07,739 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.42 [2019-03-28 12:24:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.42 [2019-03-28 12:24:07,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2120471750, now seen corresponding path program 4 times 251.16/191.42 [2019-03-28 12:24:07,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.42 [2019-03-28 12:24:07,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.42 [2019-03-28 12:24:07,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:07,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:07,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:08,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.42 [2019-03-28 12:24:08,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.42 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.42 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.42 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.42 [2019-03-28 12:24:08,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 251.16/191.42 [2019-03-28 12:24:08,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 251.16/191.42 [2019-03-28 12:24:08,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:08,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 51 conjunts are in the unsatisfiable core 251.16/191.42 [2019-03-28 12:24:08,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.42 [2019-03-28 12:24:08,221 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:08,221 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,234 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:08,237 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:08,237 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,248 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:08,249 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,249 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:24 251.16/191.42 [2019-03-28 12:24:08,348 INFO L340 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size 251.16/191.42 [2019-03-28 12:24:08,348 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 251.16/191.42 [2019-03-28 12:24:08,349 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,379 INFO L497 ElimStorePlain]: treesize reduction 8, result has 83.7 percent of original size 251.16/191.42 [2019-03-28 12:24:08,384 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:08,385 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.42 [2019-03-28 12:24:08,385 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,396 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:08,396 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,396 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:26 251.16/191.42 [2019-03-28 12:24:08,481 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:08,482 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 51 251.16/191.42 [2019-03-28 12:24:08,482 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,561 INFO L497 ElimStorePlain]: treesize reduction 28, result has 69.2 percent of original size 251.16/191.42 [2019-03-28 12:24:08,566 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:08,566 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.42 [2019-03-28 12:24:08,567 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,593 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:08,594 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,594 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:47 251.16/191.42 [2019-03-28 12:24:08,692 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_96|], 6=[|v_#memory_$Pointer$.base_114|]} 251.16/191.42 [2019-03-28 12:24:08,698 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:08,699 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.42 [2019-03-28 12:24:08,699 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,723 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:08,789 INFO L340 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size 251.16/191.42 [2019-03-28 12:24:08,790 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 73 251.16/191.42 [2019-03-28 12:24:08,792 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,855 INFO L497 ElimStorePlain]: treesize reduction 22, result has 73.2 percent of original size 251.16/191.42 [2019-03-28 12:24:08,856 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,857 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:73 251.16/191.42 [2019-03-28 12:24:08,926 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:08,930 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 251.16/191.42 [2019-03-28 12:24:08,931 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:08,936 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:08,939 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 251.16/191.42 [2019-03-28 12:24:08,939 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,048 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 251.16/191.42 [2019-03-28 12:24:09,048 INFO L497 ElimStorePlain]: treesize reduction 7, result has 95.0 percent of original size 251.16/191.42 [2019-03-28 12:24:09,059 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:09,059 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 76 251.16/191.42 [2019-03-28 12:24:09,060 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,070 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:09,070 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 251.16/191.42 [2019-03-28 12:24:09,071 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,119 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:09,119 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,120 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:143, output treesize:122 251.16/191.42 [2019-03-28 12:24:09,235 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_97|], 6=[|v_#memory_$Pointer$.base_115|]} 251.16/191.42 [2019-03-28 12:24:09,244 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:09,250 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 251.16/191.42 [2019-03-28 12:24:09,251 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,257 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:09,261 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 91 251.16/191.42 [2019-03-28 12:24:09,262 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,334 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:09,342 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:09,373 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:09,373 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 129 251.16/191.42 [2019-03-28 12:24:09,374 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,381 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:09,384 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 251.16/191.42 [2019-03-28 12:24:09,385 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,525 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 251.16/191.42 [2019-03-28 12:24:09,526 INFO L497 ElimStorePlain]: treesize reduction 52, result has 77.0 percent of original size 251.16/191.42 [2019-03-28 12:24:09,527 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,527 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:174, output treesize:174 251.16/191.42 [2019-03-28 12:24:09,921 INFO L388 ElimStorePlain]: Different consts {6=[|v_#memory_$Pointer$.offset_98|], 50=[|v_#memory_$Pointer$.base_116|]} 251.16/191.42 [2019-03-28 12:24:09,942 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:09,964 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 130 251.16/191.42 [2019-03-28 12:24:09,965 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,978 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:09,989 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 177 251.16/191.42 [2019-03-28 12:24:09,990 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:09,999 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:10,005 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 128 251.16/191.42 [2019-03-28 12:24:10,005 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:10,151 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 83 251.16/191.42 [2019-03-28 12:24:10,152 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:10,209 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:10,209 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 149 251.16/191.42 [2019-03-28 12:24:10,213 INFO L427 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:10,269 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:10,269 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 147 251.16/191.42 [2019-03-28 12:24:10,276 INFO L427 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:10,364 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:10,365 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 226 251.16/191.42 [2019-03-28 12:24:10,433 INFO L427 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:10,682 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 88 251.16/191.42 [2019-03-28 12:24:10,682 INFO L497 ElimStorePlain]: treesize reduction 282, result has 39.9 percent of original size 251.16/191.42 [2019-03-28 12:24:10,685 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. 251.16/191.42 [2019-03-28 12:24:10,685 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:580, output treesize:341 251.16/191.42 [2019-03-28 12:24:10,918 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 251.16/191.42 [2019-03-28 12:24:10,928 INFO L388 ElimStorePlain]: Different consts {0=[|#memory_$Pointer$.offset|, v_prenex_14, v_prenex_17], 2=[|#memory_$Pointer$.base|, v_prenex_13], 6=[v_prenex_16]} 251.16/191.42 [2019-03-28 12:24:10,935 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 251.16/191.42 [2019-03-28 12:24:10,936 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:11,004 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:11,010 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 251.16/191.42 [2019-03-28 12:24:11,010 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:11,072 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:11,079 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 251.16/191.42 [2019-03-28 12:24:11,079 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:11,139 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:11,151 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:11,151 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 53 251.16/191.42 [2019-03-28 12:24:11,152 INFO L427 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:11,266 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 251.16/191.42 [2019-03-28 12:24:11,267 INFO L497 ElimStorePlain]: treesize reduction 14, result has 94.1 percent of original size 251.16/191.42 [2019-03-28 12:24:11,278 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:11,279 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 51 251.16/191.42 [2019-03-28 12:24:11,280 INFO L427 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:11,385 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 251.16/191.42 [2019-03-28 12:24:11,385 INFO L497 ElimStorePlain]: treesize reduction 14, result has 92.6 percent of original size 251.16/191.42 [2019-03-28 12:24:11,413 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:11,414 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 87 251.16/191.42 [2019-03-28 12:24:11,417 INFO L427 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:11,531 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 251.16/191.42 [2019-03-28 12:24:11,531 INFO L497 ElimStorePlain]: treesize reduction 32, result has 77.6 percent of original size 251.16/191.42 [2019-03-28 12:24:11,532 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. 251.16/191.42 [2019-03-28 12:24:11,533 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:307, output treesize:88 251.16/191.42 [2019-03-28 12:24:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:11,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.42 [2019-03-28 12:24:11,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 251.16/191.42 [2019-03-28 12:24:11,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states 251.16/191.42 [2019-03-28 12:24:11,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. 251.16/191.42 [2019-03-28 12:24:11,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 251.16/191.42 [2019-03-28 12:24:11,648 INFO L87 Difference]: Start difference. First operand 294 states and 455 transitions. Second operand 30 states. 251.16/191.42 [2019-03-28 12:24:13,925 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 251.16/191.42 [2019-03-28 12:24:14,547 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 251.16/191.42 [2019-03-28 12:24:14,931 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 251.16/191.42 [2019-03-28 12:24:15,610 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 251.16/191.42 [2019-03-28 12:24:15,881 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 251.16/191.42 [2019-03-28 12:24:16,359 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 251.16/191.42 [2019-03-28 12:24:16,549 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 251.16/191.42 [2019-03-28 12:24:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.42 [2019-03-28 12:24:17,415 INFO L93 Difference]: Finished difference Result 613 states and 921 transitions. 251.16/191.42 [2019-03-28 12:24:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 251.16/191.42 [2019-03-28 12:24:17,416 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 251.16/191.42 [2019-03-28 12:24:17,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.42 [2019-03-28 12:24:17,419 INFO L225 Difference]: With dead ends: 613 251.16/191.42 [2019-03-28 12:24:17,419 INFO L226 Difference]: Without dead ends: 606 251.16/191.42 [2019-03-28 12:24:17,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=421, Invalid=2659, Unknown=0, NotChecked=0, Total=3080 251.16/191.42 [2019-03-28 12:24:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. 251.16/191.42 [2019-03-28 12:24:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 364. 251.16/191.42 [2019-03-28 12:24:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. 251.16/191.42 [2019-03-28 12:24:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 569 transitions. 251.16/191.42 [2019-03-28 12:24:17,450 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 569 transitions. Word has length 29 251.16/191.42 [2019-03-28 12:24:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.42 [2019-03-28 12:24:17,451 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 569 transitions. 251.16/191.42 [2019-03-28 12:24:17,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. 251.16/191.42 [2019-03-28 12:24:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 569 transitions. 251.16/191.42 [2019-03-28 12:24:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 251.16/191.42 [2019-03-28 12:24:17,452 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.42 [2019-03-28 12:24:17,452 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.42 [2019-03-28 12:24:17,452 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.42 [2019-03-28 12:24:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.42 [2019-03-28 12:24:17,452 INFO L82 PathProgramCache]: Analyzing trace with hash 127006886, now seen corresponding path program 3 times 251.16/191.42 [2019-03-28 12:24:17,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.42 [2019-03-28 12:24:17,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.42 [2019-03-28 12:24:17,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:17,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:17,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:17,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.42 [2019-03-28 12:24:17,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.42 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.42 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.42 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.42 [2019-03-28 12:24:17,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 251.16/191.42 [2019-03-28 12:24:17,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) 251.16/191.42 [2019-03-28 12:24:17,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:17,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 57 conjunts are in the unsatisfiable core 251.16/191.42 [2019-03-28 12:24:17,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.42 [2019-03-28 12:24:17,987 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.42 [2019-03-28 12:24:17,988 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:17,998 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:17,998 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:17,999 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 251.16/191.42 [2019-03-28 12:24:18,037 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:18,038 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,057 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:18,060 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:18,060 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,077 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:18,077 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,078 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:49 251.16/191.42 [2019-03-28 12:24:18,164 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:18,164 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.42 [2019-03-28 12:24:18,165 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,183 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:18,200 INFO L340 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size 251.16/191.42 [2019-03-28 12:24:18,200 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 251.16/191.42 [2019-03-28 12:24:18,201 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,227 INFO L497 ElimStorePlain]: treesize reduction 8, result has 83.0 percent of original size 251.16/191.42 [2019-03-28 12:24:18,228 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,228 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 251.16/191.42 [2019-03-28 12:24:18,274 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:18,276 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:18,285 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:18,285 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 251.16/191.42 [2019-03-28 12:24:18,285 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,323 INFO L497 ElimStorePlain]: treesize reduction 14, result has 77.0 percent of original size 251.16/191.42 [2019-03-28 12:24:18,324 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,324 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:47 251.16/191.42 [2019-03-28 12:24:18,411 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:18,412 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.42 [2019-03-28 12:24:18,412 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,445 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:18,449 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:18,450 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.42 [2019-03-28 12:24:18,450 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,472 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:18,472 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,472 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:55 251.16/191.42 [2019-03-28 12:24:18,587 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_102|], 6=[|v_#memory_$Pointer$.base_120|]} 251.16/191.42 [2019-03-28 12:24:18,592 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:18,592 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.42 [2019-03-28 12:24:18,592 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,619 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:18,672 INFO L340 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size 251.16/191.42 [2019-03-28 12:24:18,673 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 73 251.16/191.42 [2019-03-28 12:24:18,679 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,804 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 251.16/191.42 [2019-03-28 12:24:18,804 INFO L497 ElimStorePlain]: treesize reduction 57, result has 69.4 percent of original size 251.16/191.42 [2019-03-28 12:24:18,806 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,806 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:160 251.16/191.42 [2019-03-28 12:24:18,947 INFO L388 ElimStorePlain]: Different consts {3=[|v_#length_48|], 6=[|v_#valid_97|]} 251.16/191.42 [2019-03-28 12:24:18,952 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:18,956 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 251.16/191.42 [2019-03-28 12:24:18,956 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:18,961 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:18,964 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 93 251.16/191.42 [2019-03-28 12:24:18,965 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:19,023 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:19,028 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:19,030 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:19,036 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:19,036 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 61 251.16/191.42 [2019-03-28 12:24:19,037 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:19,042 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:19,044 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:19,047 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:19,048 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 88 251.16/191.42 [2019-03-28 12:24:19,048 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:19,096 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:19,097 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 251.16/191.42 [2019-03-28 12:24:19,097 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:152, output treesize:124 251.16/191.42 [2019-03-28 12:24:19,209 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.offset_103|], 6=[|v_#memory_$Pointer$.base_121|]} 251.16/191.42 [2019-03-28 12:24:19,216 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:19,222 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 251.16/191.42 [2019-03-28 12:24:19,222 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:19,228 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:19,232 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 100 251.16/191.42 [2019-03-28 12:24:19,233 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:19,307 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:19,313 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:19,317 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 251.16/191.42 [2019-03-28 12:24:19,318 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:19,364 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:19,365 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 160 251.16/191.42 [2019-03-28 12:24:19,384 INFO L427 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:19,552 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 251.16/191.42 [2019-03-28 12:24:19,552 INFO L497 ElimStorePlain]: treesize reduction 64, result has 71.4 percent of original size 251.16/191.42 [2019-03-28 12:24:19,554 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 251.16/191.42 [2019-03-28 12:24:19,554 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:176, output treesize:187 251.16/191.42 [2019-03-28 12:24:19,744 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 251.16/191.42 [2019-03-28 12:24:20,183 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 64 251.16/191.42 [2019-03-28 12:24:20,382 INFO L388 ElimStorePlain]: Different consts {6=[|v_#memory_$Pointer$.offset_104|], 50=[|v_#memory_$Pointer$.base_122|]} 251.16/191.42 [2019-03-28 12:24:20,417 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 127 251.16/191.42 [2019-03-28 12:24:20,417 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:20,438 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 129 251.16/191.42 [2019-03-28 12:24:20,438 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:20,450 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 127 251.16/191.42 [2019-03-28 12:24:20,451 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:20,611 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 85 251.16/191.42 [2019-03-28 12:24:20,612 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:20,667 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:20,667 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 150 251.16/191.42 [2019-03-28 12:24:20,679 INFO L427 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:20,700 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:20,730 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:20,730 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 136 251.16/191.42 [2019-03-28 12:24:20,732 INFO L427 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:20,820 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:20,820 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 229 251.16/191.42 [2019-03-28 12:24:21,636 INFO L427 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:21,891 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 76 251.16/191.42 [2019-03-28 12:24:21,892 INFO L497 ElimStorePlain]: treesize reduction 612, result has 27.6 percent of original size 251.16/191.42 [2019-03-28 12:24:21,893 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. 251.16/191.42 [2019-03-28 12:24:21,893 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:498, output treesize:252 251.16/191.42 [2019-03-28 12:24:26,470 WARN L188 SmtUtils]: Spent 4.50 s on a formula simplification that was a NOOP. DAG size: 71 251.16/191.42 [2019-03-28 12:24:26,479 INFO L388 ElimStorePlain]: Different consts {0=[v_prenex_30, |#memory_$Pointer$.offset|, v_prenex_33], 2=[v_prenex_32, |#memory_$Pointer$.base|], 6=[v_prenex_29]} 251.16/191.42 [2019-03-28 12:24:26,486 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 251.16/191.42 [2019-03-28 12:24:26,487 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:26,557 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:26,563 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 251.16/191.42 [2019-03-28 12:24:26,563 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:26,631 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:26,636 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 251.16/191.42 [2019-03-28 12:24:26,637 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:26,715 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:26,727 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:26,727 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 54 251.16/191.42 [2019-03-28 12:24:26,728 INFO L427 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:26,849 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 251.16/191.42 [2019-03-28 12:24:26,850 INFO L497 ElimStorePlain]: treesize reduction 14, result has 93.7 percent of original size 251.16/191.42 [2019-03-28 12:24:26,856 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:26,856 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:26,857 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 40 251.16/191.42 [2019-03-28 12:24:26,857 INFO L427 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:26,912 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:26,936 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:26,936 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 90 251.16/191.42 [2019-03-28 12:24:26,940 INFO L427 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:27,055 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 251.16/191.42 [2019-03-28 12:24:27,055 INFO L497 ElimStorePlain]: treesize reduction 32, result has 79.1 percent of original size 251.16/191.42 [2019-03-28 12:24:27,057 INFO L427 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. 251.16/191.42 [2019-03-28 12:24:27,057 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:285, output treesize:81 251.16/191.42 [2019-03-28 12:24:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:27,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.42 [2019-03-28 12:24:27,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 251.16/191.42 [2019-03-28 12:24:27,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states 251.16/191.42 [2019-03-28 12:24:27,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. 251.16/191.42 [2019-03-28 12:24:27,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 251.16/191.42 [2019-03-28 12:24:27,182 INFO L87 Difference]: Start difference. First operand 364 states and 569 transitions. Second operand 32 states. 251.16/191.42 [2019-03-28 12:24:34,016 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 251.16/191.42 [2019-03-28 12:24:34,762 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 251.16/191.42 [2019-03-28 12:24:35,869 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 251.16/191.42 [2019-03-28 12:24:36,426 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 251.16/191.42 [2019-03-28 12:24:37,398 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 251.16/191.42 [2019-03-28 12:24:38,095 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 251.16/191.42 [2019-03-28 12:24:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.42 [2019-03-28 12:24:39,039 INFO L93 Difference]: Finished difference Result 630 states and 959 transitions. 251.16/191.42 [2019-03-28 12:24:39,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. 251.16/191.42 [2019-03-28 12:24:39,053 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 29 251.16/191.42 [2019-03-28 12:24:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.42 [2019-03-28 12:24:39,056 INFO L225 Difference]: With dead ends: 630 251.16/191.42 [2019-03-28 12:24:39,056 INFO L226 Difference]: Without dead ends: 565 251.16/191.42 [2019-03-28 12:24:39,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=651, Invalid=4041, Unknown=0, NotChecked=0, Total=4692 251.16/191.42 [2019-03-28 12:24:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. 251.16/191.42 [2019-03-28 12:24:39,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 388. 251.16/191.42 [2019-03-28 12:24:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. 251.16/191.42 [2019-03-28 12:24:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 607 transitions. 251.16/191.42 [2019-03-28 12:24:39,091 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 607 transitions. Word has length 29 251.16/191.42 [2019-03-28 12:24:39,091 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.42 [2019-03-28 12:24:39,091 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 607 transitions. 251.16/191.42 [2019-03-28 12:24:39,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. 251.16/191.42 [2019-03-28 12:24:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 607 transitions. 251.16/191.42 [2019-03-28 12:24:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 251.16/191.42 [2019-03-28 12:24:39,092 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.42 [2019-03-28 12:24:39,092 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.42 [2019-03-28 12:24:39,093 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.42 [2019-03-28 12:24:39,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.42 [2019-03-28 12:24:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 561429817, now seen corresponding path program 6 times 251.16/191.42 [2019-03-28 12:24:39,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.42 [2019-03-28 12:24:39,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.42 [2019-03-28 12:24:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:39,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:39,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.42 [2019-03-28 12:24:39,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.42 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.42 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.42 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.42 [2019-03-28 12:24:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE 251.16/191.42 [2019-03-28 12:24:39,504 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) 251.16/191.42 [2019-03-28 12:24:39,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:39,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 61 conjunts are in the unsatisfiable core 251.16/191.42 [2019-03-28 12:24:39,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.42 [2019-03-28 12:24:39,528 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.42 [2019-03-28 12:24:39,528 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,538 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:39,538 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,538 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 251.16/191.42 [2019-03-28 12:24:39,572 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:39,573 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,587 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:39,590 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:39,591 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,605 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:39,605 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,606 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:44 251.16/191.42 [2019-03-28 12:24:39,682 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:39,683 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 251.16/191.42 [2019-03-28 12:24:39,683 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,701 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:39,705 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:39,706 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 251.16/191.42 [2019-03-28 12:24:39,706 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,719 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:39,719 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,719 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:45 251.16/191.42 [2019-03-28 12:24:39,763 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:39,764 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 251.16/191.42 [2019-03-28 12:24:39,764 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,778 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:39,778 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,779 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 251.16/191.42 [2019-03-28 12:24:39,868 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:24:39,877 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:39,877 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 251.16/191.42 [2019-03-28 12:24:39,877 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,926 INFO L497 ElimStorePlain]: treesize reduction 16, result has 79.2 percent of original size 251.16/191.42 [2019-03-28 12:24:39,929 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:39,930 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.42 [2019-03-28 12:24:39,930 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,949 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:39,949 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:39,950 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:60 251.16/191.42 [2019-03-28 12:24:40,049 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_int_20|], 6=[|v_#memory_$Pointer$.base_126|, |v_#memory_$Pointer$.offset_108|]} 251.16/191.42 [2019-03-28 12:24:40,053 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 251.16/191.42 [2019-03-28 12:24:40,053 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:40,085 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:40,089 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:24:40,123 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:40,123 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 209 treesize of output 190 251.16/191.42 [2019-03-28 12:24:40,129 INFO L427 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:40,198 INFO L497 ElimStorePlain]: treesize reduction 106, result has 47.8 percent of original size 251.16/191.42 [2019-03-28 12:24:40,202 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:40,203 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:40,204 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 251.16/191.42 [2019-03-28 12:24:40,204 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:40,226 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:40,227 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:40,227 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:244, output treesize:90 251.16/191.42 [2019-03-28 12:24:40,333 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:24:40,334 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:24:40,345 INFO L340 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size 251.16/191.42 [2019-03-28 12:24:40,345 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 57 251.16/191.42 [2019-03-28 12:24:40,346 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:40,383 INFO L497 ElimStorePlain]: treesize reduction 8, result has 87.9 percent of original size 251.16/191.42 [2019-03-28 12:24:40,386 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:40,390 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:40,390 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 251.16/191.42 [2019-03-28 12:24:40,391 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. 251.16/191.42 [2019-03-28 12:24:40,416 INFO L497 ElimStorePlain]: treesize reduction 7, result has 82.1 percent of original size 251.16/191.42 [2019-03-28 12:24:40,417 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:40,417 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:14 251.16/191.42 [2019-03-28 12:24:40,450 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 251.16/191.42 [2019-03-28 12:24:40,451 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:40,454 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:40,454 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:40,454 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:3 251.16/191.42 [2019-03-28 12:24:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:40,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.42 [2019-03-28 12:24:40,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 251.16/191.42 [2019-03-28 12:24:40,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states 251.16/191.42 [2019-03-28 12:24:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. 251.16/191.42 [2019-03-28 12:24:40,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 251.16/191.42 [2019-03-28 12:24:40,489 INFO L87 Difference]: Start difference. First operand 388 states and 607 transitions. Second operand 27 states. 251.16/191.42 [2019-03-28 12:24:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.42 [2019-03-28 12:24:42,190 INFO L93 Difference]: Finished difference Result 515 states and 782 transitions. 251.16/191.42 [2019-03-28 12:24:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 251.16/191.42 [2019-03-28 12:24:42,191 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 251.16/191.42 [2019-03-28 12:24:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.42 [2019-03-28 12:24:42,193 INFO L225 Difference]: With dead ends: 515 251.16/191.42 [2019-03-28 12:24:42,193 INFO L226 Difference]: Without dead ends: 496 251.16/191.42 [2019-03-28 12:24:42,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 251.16/191.42 [2019-03-28 12:24:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. 251.16/191.42 [2019-03-28 12:24:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 397. 251.16/191.42 [2019-03-28 12:24:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. 251.16/191.42 [2019-03-28 12:24:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 620 transitions. 251.16/191.42 [2019-03-28 12:24:42,233 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 620 transitions. Word has length 29 251.16/191.42 [2019-03-28 12:24:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.42 [2019-03-28 12:24:42,234 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 620 transitions. 251.16/191.42 [2019-03-28 12:24:42,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. 251.16/191.42 [2019-03-28 12:24:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 620 transitions. 251.16/191.42 [2019-03-28 12:24:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 251.16/191.42 [2019-03-28 12:24:42,235 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.42 [2019-03-28 12:24:42,235 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.42 [2019-03-28 12:24:42,235 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.42 [2019-03-28 12:24:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.42 [2019-03-28 12:24:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1404205337, now seen corresponding path program 3 times 251.16/191.42 [2019-03-28 12:24:42,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.42 [2019-03-28 12:24:42,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.42 [2019-03-28 12:24:42,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:42,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:42,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:42,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.42 [2019-03-28 12:24:42,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.42 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.42 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.42 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.42 [2019-03-28 12:24:42,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 251.16/191.42 [2019-03-28 12:24:42,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) 251.16/191.42 [2019-03-28 12:24:42,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:42,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 62 conjunts are in the unsatisfiable core 251.16/191.42 [2019-03-28 12:24:42,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.42 [2019-03-28 12:24:42,759 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:42,759 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 251.16/191.42 [2019-03-28 12:24:42,760 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:42,771 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:42,771 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:42,772 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 251.16/191.42 [2019-03-28 12:24:42,813 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:42,814 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:42,832 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:42,835 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:42,835 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:42,851 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:42,852 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:42,852 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:49 251.16/191.42 [2019-03-28 12:24:42,937 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:42,938 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 251.16/191.42 [2019-03-28 12:24:42,938 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:42,960 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:42,963 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:42,963 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 251.16/191.42 [2019-03-28 12:24:42,964 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:42,978 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:42,978 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:42,979 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 251.16/191.42 [2019-03-28 12:24:43,026 INFO L388 ElimStorePlain]: Different consts {0=[|v_#length_49|], 3=[|v_#valid_101|]} 251.16/191.42 [2019-03-28 12:24:43,030 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.42 [2019-03-28 12:24:43,030 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,051 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,056 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:43,064 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,064 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 251.16/191.42 [2019-03-28 12:24:43,064 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,082 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,082 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,082 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:52 251.16/191.42 [2019-03-28 12:24:43,211 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:43,211 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 251.16/191.42 [2019-03-28 12:24:43,212 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,239 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,243 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:43,243 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.42 [2019-03-28 12:24:43,244 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,267 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,267 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,267 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:75 251.16/191.42 [2019-03-28 12:24:43,386 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_int_21|], 6=[|v_#memory_$Pointer$.offset_112|, |v_#memory_$Pointer$.base_130|]} 251.16/191.42 [2019-03-28 12:24:43,391 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 251.16/191.42 [2019-03-28 12:24:43,391 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,435 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,439 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:43,440 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:43,441 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 126 251.16/191.42 [2019-03-28 12:24:43,441 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,469 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,473 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:43,473 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:24:43,477 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,477 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 73 251.16/191.42 [2019-03-28 12:24:43,477 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,524 INFO L497 ElimStorePlain]: treesize reduction 26, result has 80.2 percent of original size 251.16/191.42 [2019-03-28 12:24:43,524 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,525 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:259, output treesize:105 251.16/191.42 [2019-03-28 12:24:43,590 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:24:43,591 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 251.16/191.42 [2019-03-28 12:24:43,591 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,610 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,611 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,611 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:116, output treesize:88 251.16/191.42 [2019-03-28 12:24:43,727 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:24:43,728 INFO L172 IndexEqualityManager]: detected equality via solver 251.16/191.42 [2019-03-28 12:24:43,740 INFO L340 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,740 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 40 251.16/191.42 [2019-03-28 12:24:43,741 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,755 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,755 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,756 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:16 251.16/191.42 [2019-03-28 12:24:43,800 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,801 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 251.16/191.42 [2019-03-28 12:24:43,801 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,809 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:43,809 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:43,809 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 251.16/191.42 [2019-03-28 12:24:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:43,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.42 [2019-03-28 12:24:43,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 32 251.16/191.42 [2019-03-28 12:24:43,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states 251.16/191.42 [2019-03-28 12:24:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. 251.16/191.42 [2019-03-28 12:24:43,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 251.16/191.42 [2019-03-28 12:24:43,929 INFO L87 Difference]: Start difference. First operand 397 states and 620 transitions. Second operand 32 states. 251.16/191.42 [2019-03-28 12:24:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.42 [2019-03-28 12:24:47,427 INFO L93 Difference]: Finished difference Result 590 states and 881 transitions. 251.16/191.42 [2019-03-28 12:24:47,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 251.16/191.42 [2019-03-28 12:24:47,427 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 29 251.16/191.42 [2019-03-28 12:24:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.42 [2019-03-28 12:24:47,430 INFO L225 Difference]: With dead ends: 590 251.16/191.42 [2019-03-28 12:24:47,430 INFO L226 Difference]: Without dead ends: 571 251.16/191.42 [2019-03-28 12:24:47,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=336, Invalid=2744, Unknown=0, NotChecked=0, Total=3080 251.16/191.42 [2019-03-28 12:24:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. 251.16/191.42 [2019-03-28 12:24:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 397. 251.16/191.42 [2019-03-28 12:24:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. 251.16/191.42 [2019-03-28 12:24:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 620 transitions. 251.16/191.42 [2019-03-28 12:24:47,470 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 620 transitions. Word has length 29 251.16/191.42 [2019-03-28 12:24:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.42 [2019-03-28 12:24:47,471 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 620 transitions. 251.16/191.42 [2019-03-28 12:24:47,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. 251.16/191.42 [2019-03-28 12:24:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 620 transitions. 251.16/191.42 [2019-03-28 12:24:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 251.16/191.42 [2019-03-28 12:24:47,472 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.42 [2019-03-28 12:24:47,472 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.42 [2019-03-28 12:24:47,472 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.42 [2019-03-28 12:24:47,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.42 [2019-03-28 12:24:47,473 INFO L82 PathProgramCache]: Analyzing trace with hash 68783843, now seen corresponding path program 1 times 251.16/191.42 [2019-03-28 12:24:47,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.42 [2019-03-28 12:24:47,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.42 [2019-03-28 12:24:47,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:47,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:47,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 251.16/191.42 [2019-03-28 12:24:47,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 251.16/191.42 [2019-03-28 12:24:47,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 251.16/191.42 [2019-03-28 12:24:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 251.16/191.42 [2019-03-28 12:24:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 251.16/191.42 [2019-03-28 12:24:47,484 INFO L87 Difference]: Start difference. First operand 397 states and 620 transitions. Second operand 3 states. 251.16/191.42 [2019-03-28 12:24:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.42 [2019-03-28 12:24:47,585 INFO L93 Difference]: Finished difference Result 501 states and 775 transitions. 251.16/191.42 [2019-03-28 12:24:47,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 251.16/191.42 [2019-03-28 12:24:47,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 251.16/191.42 [2019-03-28 12:24:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.42 [2019-03-28 12:24:47,587 INFO L225 Difference]: With dead ends: 501 251.16/191.42 [2019-03-28 12:24:47,587 INFO L226 Difference]: Without dead ends: 292 251.16/191.42 [2019-03-28 12:24:47,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 251.16/191.42 [2019-03-28 12:24:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. 251.16/191.42 [2019-03-28 12:24:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 258. 251.16/191.42 [2019-03-28 12:24:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. 251.16/191.42 [2019-03-28 12:24:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 403 transitions. 251.16/191.42 [2019-03-28 12:24:47,616 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 403 transitions. Word has length 29 251.16/191.42 [2019-03-28 12:24:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.42 [2019-03-28 12:24:47,616 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 403 transitions. 251.16/191.42 [2019-03-28 12:24:47,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 251.16/191.42 [2019-03-28 12:24:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 403 transitions. 251.16/191.42 [2019-03-28 12:24:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 251.16/191.42 [2019-03-28 12:24:47,617 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.42 [2019-03-28 12:24:47,617 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.42 [2019-03-28 12:24:47,618 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.42 [2019-03-28 12:24:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.42 [2019-03-28 12:24:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash 904121185, now seen corresponding path program 4 times 251.16/191.42 [2019-03-28 12:24:47,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.42 [2019-03-28 12:24:47,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.42 [2019-03-28 12:24:47,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:47,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:47,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:24:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:47,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.42 [2019-03-28 12:24:47,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.42 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.42 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.42 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.42 [2019-03-28 12:24:47,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 251.16/191.42 [2019-03-28 12:24:47,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 251.16/191.42 [2019-03-28 12:24:47,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:24:47,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 54 conjunts are in the unsatisfiable core 251.16/191.42 [2019-03-28 12:24:47,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.42 [2019-03-28 12:24:47,960 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 251.16/191.42 [2019-03-28 12:24:47,961 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:47,965 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:47,965 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:47,965 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 251.16/191.42 [2019-03-28 12:24:47,984 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:47,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 251.16/191.42 [2019-03-28 12:24:47,985 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,005 INFO L497 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size 251.16/191.42 [2019-03-28 12:24:48,006 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,006 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 251.16/191.42 [2019-03-28 12:24:48,036 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:48,036 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,047 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,047 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,047 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 251.16/191.42 [2019-03-28 12:24:48,123 INFO L340 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size 251.16/191.42 [2019-03-28 12:24:48,123 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 251.16/191.42 [2019-03-28 12:24:48,123 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,140 INFO L497 ElimStorePlain]: treesize reduction 8, result has 75.8 percent of original size 251.16/191.42 [2019-03-28 12:24:48,140 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,140 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:25 251.16/191.42 [2019-03-28 12:24:48,172 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,173 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 251.16/191.42 [2019-03-28 12:24:48,173 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,180 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,181 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,181 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 251.16/191.42 [2019-03-28 12:24:48,225 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,226 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 56 251.16/191.42 [2019-03-28 12:24:48,226 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,252 INFO L497 ElimStorePlain]: treesize reduction 28, result has 56.9 percent of original size 251.16/191.42 [2019-03-28 12:24:48,252 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,252 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:40 251.16/191.42 [2019-03-28 12:24:48,370 INFO L340 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size 251.16/191.42 [2019-03-28 12:24:48,370 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 72 251.16/191.42 [2019-03-28 12:24:48,372 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,402 INFO L497 ElimStorePlain]: treesize reduction 32, result has 53.6 percent of original size 251.16/191.42 [2019-03-28 12:24:48,402 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,403 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:81, output treesize:46 251.16/191.42 [2019-03-28 12:24:48,446 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,447 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 59 251.16/191.42 [2019-03-28 12:24:48,447 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,482 INFO L497 ElimStorePlain]: treesize reduction 26, result has 75.9 percent of original size 251.16/191.42 [2019-03-28 12:24:48,483 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,483 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:82 251.16/191.42 [2019-03-28 12:24:48,531 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_$Pointer$.offset_113|], 6=[|v_#memory_$Pointer$.base_135|]} 251.16/191.42 [2019-03-28 12:24:48,535 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:24:48,535 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,555 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,596 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,596 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 129 251.16/191.42 [2019-03-28 12:24:48,601 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,654 INFO L497 ElimStorePlain]: treesize reduction 76, result has 45.7 percent of original size 251.16/191.42 [2019-03-28 12:24:48,655 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,655 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:105, output treesize:68 251.16/191.42 [2019-03-28 12:24:48,709 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 7 251.16/191.42 [2019-03-28 12:24:48,710 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,723 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,723 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,724 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:104, output treesize:69 251.16/191.42 [2019-03-28 12:24:48,774 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_int_22|], 4=[|v_#memory_$Pointer$.base_136|]} 251.16/191.42 [2019-03-28 12:24:48,778 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 251.16/191.42 [2019-03-28 12:24:48,778 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,798 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,830 INFO L340 Elim1Store]: treesize reduction 24, result has 58.6 percent of original size 251.16/191.42 [2019-03-28 12:24:48,830 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 65 251.16/191.42 [2019-03-28 12:24:48,832 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,874 INFO L497 ElimStorePlain]: treesize reduction 14, result has 86.3 percent of original size 251.16/191.42 [2019-03-28 12:24:48,874 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,875 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:92, output treesize:88 251.16/191.42 [2019-03-28 12:24:48,940 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:48,940 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 80 251.16/191.42 [2019-03-28 12:24:48,941 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,944 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 251.16/191.42 [2019-03-28 12:24:48,944 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,968 INFO L497 ElimStorePlain]: treesize reduction 75, result has 31.2 percent of original size 251.16/191.42 [2019-03-28 12:24:48,969 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:48,969 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:133, output treesize:34 251.16/191.42 [2019-03-28 12:24:49,014 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 251.16/191.42 [2019-03-28 12:24:49,015 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:49,021 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:24:49,021 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:24:49,021 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 251.16/191.42 [2019-03-28 12:24:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:24:49,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 251.16/191.42 [2019-03-28 12:24:49,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 251.16/191.42 [2019-03-28 12:24:49,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states 251.16/191.42 [2019-03-28 12:24:49,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. 251.16/191.42 [2019-03-28 12:24:49,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 251.16/191.42 [2019-03-28 12:24:49,088 INFO L87 Difference]: Start difference. First operand 258 states and 403 transitions. Second operand 29 states. 251.16/191.42 [2019-03-28 12:25:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 251.16/191.42 [2019-03-28 12:25:13,588 INFO L93 Difference]: Finished difference Result 367 states and 560 transitions. 251.16/191.42 [2019-03-28 12:25:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 251.16/191.42 [2019-03-28 12:25:13,589 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 251.16/191.42 [2019-03-28 12:25:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 251.16/191.42 [2019-03-28 12:25:13,591 INFO L225 Difference]: With dead ends: 367 251.16/191.42 [2019-03-28 12:25:13,591 INFO L226 Difference]: Without dead ends: 365 251.16/191.42 [2019-03-28 12:25:13,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=420, Invalid=1932, Unknown=0, NotChecked=0, Total=2352 251.16/191.42 [2019-03-28 12:25:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. 251.16/191.42 [2019-03-28 12:25:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 267. 251.16/191.42 [2019-03-28 12:25:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. 251.16/191.42 [2019-03-28 12:25:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 416 transitions. 251.16/191.42 [2019-03-28 12:25:13,622 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 416 transitions. Word has length 29 251.16/191.42 [2019-03-28 12:25:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. 251.16/191.42 [2019-03-28 12:25:13,623 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 416 transitions. 251.16/191.42 [2019-03-28 12:25:13,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. 251.16/191.42 [2019-03-28 12:25:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 416 transitions. 251.16/191.42 [2019-03-28 12:25:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 251.16/191.42 [2019-03-28 12:25:13,624 INFO L394 BasicCegarLoop]: Found error trace 251.16/191.42 [2019-03-28 12:25:13,624 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 251.16/191.42 [2019-03-28 12:25:13,624 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== 251.16/191.42 [2019-03-28 12:25:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 251.16/191.42 [2019-03-28 12:25:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash 904121188, now seen corresponding path program 3 times 251.16/191.42 [2019-03-28 12:25:13,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 251.16/191.42 [2019-03-28 12:25:13,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 251.16/191.42 [2019-03-28 12:25:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:25:13,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:25:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 251.16/191.42 [2019-03-28 12:25:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:25:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 251.16/191.42 [2019-03-28 12:25:14,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 251.16/191.42 [2019-03-28 12:25:14,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 251.16/191.42 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 251.16/191.42 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 251.16/191.42 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.42 [2019-03-28 12:25:14,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 251.16/191.42 [2019-03-28 12:25:14,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) 251.16/191.42 [2019-03-28 12:25:14,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 251.16/191.42 [2019-03-28 12:25:14,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 76 conjunts are in the unsatisfiable core 251.16/191.42 [2019-03-28 12:25:14,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... 251.16/191.42 [2019-03-28 12:25:14,139 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,139 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 251.16/191.42 [2019-03-28 12:25:14,140 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,146 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,146 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,147 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 251.16/191.42 [2019-03-28 12:25:14,151 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:25:14,152 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,164 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,167 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 251.16/191.42 [2019-03-28 12:25:14,167 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,178 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,179 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,179 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 251.16/191.42 [2019-03-28 12:25:14,193 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.42 [2019-03-28 12:25:14,194 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,207 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,209 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 251.16/191.42 [2019-03-28 12:25:14,209 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,218 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,219 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,219 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:30 251.16/191.42 [2019-03-28 12:25:14,226 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,226 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 251.16/191.42 [2019-03-28 12:25:14,226 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,236 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,237 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,237 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 251.16/191.42 [2019-03-28 12:25:14,275 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.42 [2019-03-28 12:25:14,276 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,295 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,298 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 251.16/191.42 [2019-03-28 12:25:14,299 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,316 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,316 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,317 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:56 251.16/191.42 [2019-03-28 12:25:14,462 INFO L340 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size 251.16/191.42 [2019-03-28 12:25:14,463 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 84 251.16/191.42 [2019-03-28 12:25:14,465 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,529 INFO L497 ElimStorePlain]: treesize reduction 22, result has 79.2 percent of original size 251.16/191.42 [2019-03-28 12:25:14,551 INFO L340 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size 251.16/191.42 [2019-03-28 12:25:14,551 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 251.16/191.42 [2019-03-28 12:25:14,551 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,578 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,579 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,579 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:112, output treesize:100 251.16/191.42 [2019-03-28 12:25:14,648 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,649 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 251.16/191.42 [2019-03-28 12:25:14,649 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,657 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,658 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 71 251.16/191.42 [2019-03-28 12:25:14,658 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,754 INFO L497 ElimStorePlain]: treesize reduction 8, result has 94.4 percent of original size 251.16/191.42 [2019-03-28 12:25:14,762 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 251.16/191.42 [2019-03-28 12:25:14,762 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,768 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 251.16/191.42 [2019-03-28 12:25:14,768 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,812 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,813 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,813 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:132 251.16/191.42 [2019-03-28 12:25:14,910 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.base_141|, |v_#memory_$Pointer$.offset_118|], 6=[v_prenex_36, v_prenex_37]} 251.16/191.42 [2019-03-28 12:25:14,919 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 251.16/191.42 [2019-03-28 12:25:14,919 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:14,984 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:14,992 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 251.16/191.42 [2019-03-28 12:25:14,993 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:15,053 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:15,085 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:15,086 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 139 251.16/191.42 [2019-03-28 12:25:15,086 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:15,215 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 251.16/191.42 [2019-03-28 12:25:15,216 INFO L497 ElimStorePlain]: treesize reduction 52, result has 77.0 percent of original size 251.16/191.42 [2019-03-28 12:25:15,242 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:15,242 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 162 251.16/191.42 [2019-03-28 12:25:15,243 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:15,364 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 251.16/191.42 [2019-03-28 12:25:15,364 INFO L497 ElimStorePlain]: treesize reduction 46, result has 78.7 percent of original size 251.16/191.42 [2019-03-28 12:25:15,366 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 251.16/191.42 [2019-03-28 12:25:15,366 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:178, output treesize:176 251.16/191.42 [2019-03-28 12:25:15,793 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_int_23|], 50=[|v_#memory_$Pointer$.base_142|, |v_#memory_$Pointer$.offset_119|]} 251.16/191.42 [2019-03-28 12:25:15,851 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 236 251.16/191.42 [2019-03-28 12:25:15,851 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:15,902 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 236 251.16/191.42 [2019-03-28 12:25:15,902 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:15,926 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 353 251.16/191.42 [2019-03-28 12:25:15,926 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:16,880 WARN L188 SmtUtils]: Spent 953.00 ms on a formula simplification that was a NOOP. DAG size: 118 251.16/191.42 [2019-03-28 12:25:16,880 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:16,942 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:16,942 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 236 treesize of output 219 251.16/191.42 [2019-03-28 12:25:16,955 INFO L427 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:17,064 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:17,065 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 353 treesize of output 314 251.16/191.42 [2019-03-28 12:25:17,160 INFO L427 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:17,172 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:25:17,204 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:17,204 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 236 treesize of output 205 251.16/191.42 [2019-03-28 12:25:17,210 INFO L427 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:17,848 WARN L188 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 127 251.16/191.42 [2019-03-28 12:25:17,848 INFO L497 ElimStorePlain]: treesize reduction 388, result has 46.4 percent of original size 251.16/191.42 [2019-03-28 12:25:17,876 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:17,877 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 114 251.16/191.42 [2019-03-28 12:25:17,877 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:17,927 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:17,927 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 199 251.16/191.42 [2019-03-28 12:25:17,928 INFO L427 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:17,949 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:17,950 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 114 251.16/191.42 [2019-03-28 12:25:17,950 INFO L427 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:18,155 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 109 251.16/191.42 [2019-03-28 12:25:18,155 INFO L497 ElimStorePlain]: treesize reduction 92, result has 72.9 percent of original size 251.16/191.42 [2019-03-28 12:25:18,160 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. 251.16/191.42 [2019-03-28 12:25:18,160 INFO L217 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:874, output treesize:553 251.16/191.42 [2019-03-28 12:25:21,270 WARN L188 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 128 DAG size of output: 86 251.16/191.42 [2019-03-28 12:25:21,287 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:21,287 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 154 251.16/191.42 [2019-03-28 12:25:21,287 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:21,299 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:21,299 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 103 251.16/191.42 [2019-03-28 12:25:21,300 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:21,309 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:21,310 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 103 251.16/191.42 [2019-03-28 12:25:21,310 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:21,386 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:21,388 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. 251.16/191.42 [2019-03-28 12:25:21,389 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:371, output treesize:343 251.16/191.42 [2019-03-28 12:25:23,326 WARN L188 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 87 251.16/191.42 [2019-03-28 12:25:23,498 INFO L388 ElimStorePlain]: Different consts {2=[v_prenex_51, v_prenex_46, v_prenex_49, v_prenex_48], 6=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} 251.16/191.42 [2019-03-28 12:25:23,504 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 86 251.16/191.42 [2019-03-28 12:25:23,505 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:23,574 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:23,586 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:23,587 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 71 251.16/191.42 [2019-03-28 12:25:23,588 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:23,731 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 251.16/191.42 [2019-03-28 12:25:23,731 INFO L497 ElimStorePlain]: treesize reduction 14, result has 95.3 percent of original size 251.16/191.42 [2019-03-28 12:25:23,737 INFO L189 IndexEqualityManager]: detected not equals via solver 251.16/191.42 [2019-03-28 12:25:23,738 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:23,738 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 37 251.16/191.42 [2019-03-28 12:25:23,739 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:23,799 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:23,804 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 251.16/191.42 [2019-03-28 12:25:23,805 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:23,859 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:23,883 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 251.16/191.42 [2019-03-28 12:25:23,884 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 117 251.16/191.42 [2019-03-28 12:25:23,887 INFO L427 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 251.16/191.42 [2019-03-28 12:25:24,007 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 251.16/191.42 [2019-03-28 12:25:24,008 INFO L497 ElimStorePlain]: treesize reduction 32, result has 81.3 percent of original size 251.16/191.42 [2019-03-28 12:25:24,211 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 251.16/191.42 [2019-03-28 12:25:24,212 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: 251.16/191.42 java.lang.UnsupportedOperationException: expected NNF 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:232) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:146) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:191) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:177) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:73) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:249) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:483) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:397) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:212) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:305) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) 251.16/191.42 at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) 251.16/191.42 at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) 251.16/191.42 [2019-03-28 12:25:24,238 INFO L168 Benchmark]: Toolchain (without parser) took 187067.03 ms. Allocated memory was 649.6 MB in the beginning and 762.3 MB in the end (delta: 112.7 MB). Free memory was 562.5 MB in the beginning and 640.2 MB in the end (delta: -77.7 MB). Peak memory consumption was 331.3 MB. Max. memory is 50.3 GB. 251.16/191.42 [2019-03-28 12:25:24,238 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 251.16/191.42 [2019-03-28 12:25:24,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.34 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 562.5 MB in the beginning and 620.4 MB in the end (delta: -57.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. 251.16/191.42 [2019-03-28 12:25:24,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.59 ms. Allocated memory is still 677.9 MB. Free memory was 620.4 MB in the beginning and 617.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 251.16/191.42 [2019-03-28 12:25:24,239 INFO L168 Benchmark]: Boogie Preprocessor took 32.36 ms. Allocated memory is still 677.9 MB. Free memory was 617.7 MB in the beginning and 616.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 251.16/191.42 [2019-03-28 12:25:24,239 INFO L168 Benchmark]: RCFGBuilder took 422.88 ms. Allocated memory is still 677.9 MB. Free memory was 616.4 MB in the beginning and 584.8 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 50.3 GB. 251.16/191.42 [2019-03-28 12:25:24,239 INFO L168 Benchmark]: BlockEncodingV2 took 132.72 ms. Allocated memory is still 677.9 MB. Free memory was 584.8 MB in the beginning and 572.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 251.16/191.42 [2019-03-28 12:25:24,239 INFO L168 Benchmark]: TraceAbstraction took 185925.50 ms. Allocated memory was 677.9 MB in the beginning and 762.3 MB in the end (delta: 84.4 MB). Free memory was 572.7 MB in the beginning and 640.2 MB in the end (delta: -67.6 MB). Peak memory consumption was 313.1 MB. Max. memory is 50.3 GB. 251.16/191.42 [2019-03-28 12:25:24,240 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 251.16/191.42 --- Results --- 251.16/191.42 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 251.16/191.42 - StatisticsResult: Initial Icfg 251.16/191.42 62 locations, 73 edges 251.16/191.42 - StatisticsResult: Encoded RCFG 251.16/191.42 51 locations, 97 edges 251.16/191.42 * Results from de.uni_freiburg.informatik.ultimate.core: 251.16/191.42 - StatisticsResult: Toolchain Benchmarks 251.16/191.42 Benchmark results are: 251.16/191.42 * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 251.16/191.42 * CACSL2BoogieTranslator took 496.34 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 562.5 MB in the beginning and 620.4 MB in the end (delta: -57.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. 251.16/191.42 * Boogie Procedure Inliner took 52.59 ms. Allocated memory is still 677.9 MB. Free memory was 620.4 MB in the beginning and 617.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 251.16/191.42 * Boogie Preprocessor took 32.36 ms. Allocated memory is still 677.9 MB. Free memory was 617.7 MB in the beginning and 616.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 251.16/191.42 * RCFGBuilder took 422.88 ms. Allocated memory is still 677.9 MB. Free memory was 616.4 MB in the beginning and 584.8 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 50.3 GB. 251.16/191.42 * BlockEncodingV2 took 132.72 ms. Allocated memory is still 677.9 MB. Free memory was 584.8 MB in the beginning and 572.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 251.16/191.42 * TraceAbstraction took 185925.50 ms. Allocated memory was 677.9 MB in the beginning and 762.3 MB in the end (delta: 84.4 MB). Free memory was 572.7 MB in the beginning and 640.2 MB in the end (delta: -67.6 MB). Peak memory consumption was 313.1 MB. Max. memory is 50.3 GB. 251.16/191.42 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 251.16/191.42 - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF 251.16/191.42 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:232) 251.16/191.42 RESULT: Ultimate could not prove your program: Toolchain returned no result. 251.16/191.42 [MP z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Forcibly destroying the process 251.16/191.42 !SESSION 2019-03-28 12:22:13.889 ----------------------------------------------- 251.16/191.42 eclipse.buildId=unknown 251.16/191.42 java.version=1.8.0_181 251.16/191.42 java.vendor=Oracle Corporation 251.16/191.42 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 251.16/191.42 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 251.16/191.42 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 251.16/191.42 251.16/191.42 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:25:24.468 251.16/191.42 !MESSAGE The workspace will exit with unsaved changes in this session. 251.16/191.42 Received shutdown request... 251.16/191.42 Ultimate: 251.16/191.42 GTK+ Version Check 251.16/191.42 EOF