/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/rew.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:49:22,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:49:22,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:49:22,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:49:22,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:49:22,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:49:22,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:49:22,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:49:22,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:49:22,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:49:22,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:49:22,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:49:22,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:49:22,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:49:22,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:49:22,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:49:22,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:49:22,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:49:22,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:49:22,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:49:22,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:49:22,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:49:22,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:49:22,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:49:22,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:49:22,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:49:22,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:49:22,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:49:22,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:49:22,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:49:22,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:49:22,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:49:22,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:49:22,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:49:22,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:49:22,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:49:22,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:49:22,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:49:22,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:49:22,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:49:22,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:49:22,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:49:22,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:49:22,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:49:22,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:49:22,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:49:22,253 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:49:22,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:49:22,254 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:49:22,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:49:22,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:49:22,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:49:22,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:49:22,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:49:22,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:49:22,255 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:49:22,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:49:22,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:49:22,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:49:22,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:49:22,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:49:22,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:49:22,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:49:22,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:49:22,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:49:22,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:49:22,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:49:22,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:49:22,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:49:22,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:49:22,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:49:22,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:49:22,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:49:22,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:49:22,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:49:22,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:49:22,595 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:49:22,596 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rew.c [2019-11-23 20:49:22,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e2daa72/5445593c815f485595191e4f822ae5a1/FLAG8581373e7 [2019-11-23 20:49:23,095 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:49:23,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rew.c [2019-11-23 20:49:23,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e2daa72/5445593c815f485595191e4f822ae5a1/FLAG8581373e7 [2019-11-23 20:49:23,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e2daa72/5445593c815f485595191e4f822ae5a1 [2019-11-23 20:49:23,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:49:23,524 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:49:23,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:49:23,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:49:23,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:49:23,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:23,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c535360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23, skipping insertion in model container [2019-11-23 20:49:23,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:23,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:49:23,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:49:23,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:49:23,813 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:49:23,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:49:23,857 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:49:23,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23 WrapperNode [2019-11-23 20:49:23,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:49:23,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:49:23,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:49:23,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:49:23,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:23,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:23,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:49:23,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:49:23,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:49:23,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:49:23,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:23,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:24,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:24,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:24,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:24,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:24,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... [2019-11-23 20:49:24,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:49:24,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:49:24,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:49:24,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:49:24,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:49:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:49:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 20:49:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:49:24,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:49:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:49:24,306 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:49:24,306 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-23 20:49:24,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:24 BoogieIcfgContainer [2019-11-23 20:49:24,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:49:24,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:49:24,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:49:24,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:49:24,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:49:23" (1/3) ... [2019-11-23 20:49:24,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c731c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:24, skipping insertion in model container [2019-11-23 20:49:24,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:23" (2/3) ... [2019-11-23 20:49:24,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c731c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:24, skipping insertion in model container [2019-11-23 20:49:24,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:24" (3/3) ... [2019-11-23 20:49:24,332 INFO L109 eAbstractionObserver]: Analyzing ICFG rew.c [2019-11-23 20:49:24,346 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:49:24,356 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:49:24,389 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:49:24,420 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:49:24,420 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:49:24,421 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:49:24,421 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:49:24,421 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:49:24,421 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:49:24,421 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:49:24,421 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:49:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-23 20:49:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 20:49:24,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:24,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:24,445 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 133671584, now seen corresponding path program 1 times [2019-11-23 20:49:24,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:24,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934518579] [2019-11-23 20:49:24,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:24,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934518579] [2019-11-23 20:49:24,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:24,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:49:24,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761105476] [2019-11-23 20:49:24,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 20:49:24,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:24,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 20:49:24,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:49:24,586 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-23 20:49:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:24,600 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-11-23 20:49:24,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 20:49:24,601 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-23 20:49:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:24,609 INFO L225 Difference]: With dead ends: 29 [2019-11-23 20:49:24,609 INFO L226 Difference]: Without dead ends: 14 [2019-11-23 20:49:24,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:49:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-23 20:49:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-23 20:49:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-23 20:49:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-23 20:49:24,641 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2019-11-23 20:49:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:24,642 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-23 20:49:24,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 20:49:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-23 20:49:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 20:49:24,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:24,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:24,643 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:24,644 INFO L82 PathProgramCache]: Analyzing trace with hash 121665811, now seen corresponding path program 1 times [2019-11-23 20:49:24,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:24,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438597713] [2019-11-23 20:49:24,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:24,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438597713] [2019-11-23 20:49:24,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:24,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:49:24,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272613786] [2019-11-23 20:49:24,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:49:24,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:24,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:49:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:49:24,724 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2019-11-23 20:49:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:24,783 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-23 20:49:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:49:24,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-23 20:49:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:24,785 INFO L225 Difference]: With dead ends: 29 [2019-11-23 20:49:24,786 INFO L226 Difference]: Without dead ends: 18 [2019-11-23 20:49:24,787 INFO L630 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 [2019-11-23 20:49:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-23 20:49:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-23 20:49:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-23 20:49:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-23 20:49:24,792 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2019-11-23 20:49:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:24,792 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-23 20:49:24,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:49:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-11-23 20:49:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 20:49:24,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:24,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:24,794 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash 729197006, now seen corresponding path program 1 times [2019-11-23 20:49:24,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:24,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378148494] [2019-11-23 20:49:24,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:24,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378148494] [2019-11-23 20:49:24,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:24,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:49:24,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134468532] [2019-11-23 20:49:24,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:49:24,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:24,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:49:24,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:49:24,878 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2019-11-23 20:49:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:24,934 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-11-23 20:49:24,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:49:24,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-23 20:49:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:24,936 INFO L225 Difference]: With dead ends: 26 [2019-11-23 20:49:24,936 INFO L226 Difference]: Without dead ends: 19 [2019-11-23 20:49:24,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:49:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-23 20:49:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-23 20:49:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-23 20:49:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-23 20:49:24,941 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-11-23 20:49:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:24,942 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-23 20:49:24,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:49:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-11-23 20:49:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 20:49:24,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:24,943 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:24,943 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1021157689, now seen corresponding path program 1 times [2019-11-23 20:49:24,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:24,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491137262] [2019-11-23 20:49:24,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:25,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491137262] [2019-11-23 20:49:25,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269554123] [2019-11-23 20:49:25,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:25,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-23 20:49:25,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:25,441 INFO L377 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 15 treesize of output 11 [2019-11-23 20:49:25,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:25,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:25,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:25,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:49:25,534 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-23 20:49:25,535 INFO L377 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 27 treesize of output 22 [2019-11-23 20:49:25,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:25,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:25,549 INFO L496 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. [2019-11-23 20:49:25,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-11-23 20:49:26,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:26,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:26,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-23 20:49:26,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079542989] [2019-11-23 20:49:26,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 20:49:26,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:26,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 20:49:26,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=146, Unknown=2, NotChecked=0, Total=182 [2019-11-23 20:49:26,320 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 14 states. [2019-11-23 20:49:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:28,065 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-11-23 20:49:28,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 20:49:28,066 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-11-23 20:49:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:28,067 INFO L225 Difference]: With dead ends: 31 [2019-11-23 20:49:28,067 INFO L226 Difference]: Without dead ends: 29 [2019-11-23 20:49:28,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=110, Invalid=349, Unknown=3, NotChecked=0, Total=462 [2019-11-23 20:49:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-23 20:49:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2019-11-23 20:49:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 20:49:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-23 20:49:28,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-11-23 20:49:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:28,074 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-23 20:49:28,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 20:49:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-11-23 20:49:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 20:49:28,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:28,075 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:28,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:28,276 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:28,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1566850755, now seen corresponding path program 1 times [2019-11-23 20:49:28,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:28,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162404110] [2019-11-23 20:49:28,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:28,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162404110] [2019-11-23 20:49:28,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182880392] [2019-11-23 20:49:28,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:28,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 20:49:28,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:28,546 INFO L377 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 [2019-11-23 20:49:28,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:28,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:28,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:28,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:49:28,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:28,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:28,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-23 20:49:28,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766612561] [2019-11-23 20:49:28,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:49:28,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:49:28,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:49:28,689 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 16 states. [2019-11-23 20:49:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:28,966 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-11-23 20:49:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 20:49:28,969 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-11-23 20:49:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:28,970 INFO L225 Difference]: With dead ends: 51 [2019-11-23 20:49:28,971 INFO L226 Difference]: Without dead ends: 49 [2019-11-23 20:49:28,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:49:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-23 20:49:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-23 20:49:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 20:49:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-23 20:49:28,979 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-11-23 20:49:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:28,979 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-23 20:49:28,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:49:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-23 20:49:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 20:49:28,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:28,981 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:29,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:29,193 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash -255872648, now seen corresponding path program 2 times [2019-11-23 20:49:29,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:29,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656129] [2019-11-23 20:49:29,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:29,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656129] [2019-11-23 20:49:29,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131447009] [2019-11-23 20:49:29,355 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:29,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:49:29,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:29,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 20:49:29,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:29,443 INFO L377 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 15 treesize of output 11 [2019-11-23 20:49:29,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:29,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:29,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:29,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-23 20:49:29,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:29,507 INFO L377 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 31 treesize of output 24 [2019-11-23 20:49:29,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:29,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:29,517 INFO L496 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. [2019-11-23 20:49:29,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:38 [2019-11-23 20:49:29,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:29,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:29,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:29,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-11-23 20:49:29,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843811103] [2019-11-23 20:49:29,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:49:29,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:29,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:49:29,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:49:29,720 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 19 states. [2019-11-23 20:49:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:30,577 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-23 20:49:30,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 20:49:30,578 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-11-23 20:49:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:30,578 INFO L225 Difference]: With dead ends: 58 [2019-11-23 20:49:30,579 INFO L226 Difference]: Without dead ends: 56 [2019-11-23 20:49:30,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 20:49:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-23 20:49:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-11-23 20:49:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:49:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-11-23 20:49:30,586 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 24 [2019-11-23 20:49:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:30,587 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-23 20:49:30,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:49:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-11-23 20:49:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 20:49:30,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:30,588 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:30,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:30,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:30,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1995245389, now seen corresponding path program 3 times [2019-11-23 20:49:30,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:30,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271451525] [2019-11-23 20:49:30,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:30,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271451525] [2019-11-23 20:49:30,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912354040] [2019-11-23 20:49:30,903 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:30,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:49:30,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:30,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 20:49:30,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:30,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:30,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-23 20:49:30,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5364920] [2019-11-23 20:49:30,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:49:30,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:30,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:49:30,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:49:30,993 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 12 states. [2019-11-23 20:49:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:31,152 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-11-23 20:49:31,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:49:31,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-23 20:49:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:31,159 INFO L225 Difference]: With dead ends: 66 [2019-11-23 20:49:31,160 INFO L226 Difference]: Without dead ends: 33 [2019-11-23 20:49:31,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:49:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-23 20:49:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-11-23 20:49:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 20:49:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-23 20:49:31,166 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2019-11-23 20:49:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:31,166 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-23 20:49:31,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:49:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-23 20:49:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 20:49:31,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:31,168 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:31,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:31,371 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:31,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:31,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1191072622, now seen corresponding path program 4 times [2019-11-23 20:49:31,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:31,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845751358] [2019-11-23 20:49:31,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:31,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845751358] [2019-11-23 20:49:31,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352469475] [2019-11-23 20:49:31,521 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:31,554 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:49:31,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:31,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:49:31,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:31,631 INFO L377 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 [2019-11-23 20:49:31,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:31,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:31,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:31,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:49:31,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:31,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:31,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-23 20:49:31,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531966577] [2019-11-23 20:49:31,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:49:31,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:49:31,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:49:31,775 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 20 states. [2019-11-23 20:49:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:32,247 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-11-23 20:49:32,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 20:49:32,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-11-23 20:49:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:32,249 INFO L225 Difference]: With dead ends: 63 [2019-11-23 20:49:32,249 INFO L226 Difference]: Without dead ends: 61 [2019-11-23 20:49:32,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:49:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-23 20:49:32,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2019-11-23 20:49:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 20:49:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-23 20:49:32,259 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 28 [2019-11-23 20:49:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:32,259 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-23 20:49:32,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:49:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-23 20:49:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 20:49:32,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:32,260 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:32,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:32,466 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash 368564393, now seen corresponding path program 5 times [2019-11-23 20:49:32,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:32,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791631182] [2019-11-23 20:49:32,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:32,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791631182] [2019-11-23 20:49:32,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000061284] [2019-11-23 20:49:32,625 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:32,677 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-23 20:49:32,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:32,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:49:32,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:32,749 INFO L377 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 15 treesize of output 11 [2019-11-23 20:49:32,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:32,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:32,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:32,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-23 20:49:32,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:32,819 INFO L377 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 31 treesize of output 24 [2019-11-23 20:49:32,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:32,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:32,833 INFO L496 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. [2019-11-23 20:49:32,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:38 [2019-11-23 20:49:33,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:33,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:33,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:33,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-11-23 20:49:33,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150061203] [2019-11-23 20:49:33,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 20:49:33,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:33,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 20:49:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=429, Unknown=1, NotChecked=0, Total=506 [2019-11-23 20:49:33,434 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 23 states. [2019-11-23 20:49:34,357 WARN L192 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-11-23 20:49:37,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:37,730 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-23 20:49:37,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:49:37,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-11-23 20:49:37,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:37,732 INFO L225 Difference]: With dead ends: 70 [2019-11-23 20:49:37,732 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 20:49:37,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=266, Invalid=1538, Unknown=2, NotChecked=0, Total=1806 [2019-11-23 20:49:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 20:49:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 33. [2019-11-23 20:49:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 20:49:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-11-23 20:49:37,742 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2019-11-23 20:49:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:37,742 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-11-23 20:49:37,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 20:49:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-11-23 20:49:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 20:49:37,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:37,743 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:37,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:37,944 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash 948898404, now seen corresponding path program 6 times [2019-11-23 20:49:37,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:37,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331245005] [2019-11-23 20:49:37,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:38,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331245005] [2019-11-23 20:49:38,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003605127] [2019-11-23 20:49:38,033 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:38,069 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-23 20:49:38,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:38,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 20:49:38,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:38,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:38,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2019-11-23 20:49:38,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264177888] [2019-11-23 20:49:38,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:49:38,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:38,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:49:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:49:38,143 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 15 states. [2019-11-23 20:49:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:38,303 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-11-23 20:49:38,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 20:49:38,303 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-11-23 20:49:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:38,304 INFO L225 Difference]: With dead ends: 64 [2019-11-23 20:49:38,304 INFO L226 Difference]: Without dead ends: 41 [2019-11-23 20:49:38,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:49:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-23 20:49:38,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-11-23 20:49:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-23 20:49:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-11-23 20:49:38,312 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2019-11-23 20:49:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:38,312 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-11-23 20:49:38,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:49:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-11-23 20:49:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 20:49:38,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:38,313 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:38,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:38,525 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:38,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:38,525 INFO L82 PathProgramCache]: Analyzing trace with hash 947747359, now seen corresponding path program 7 times [2019-11-23 20:49:38,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:38,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479635849] [2019-11-23 20:49:38,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:38,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479635849] [2019-11-23 20:49:38,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135737755] [2019-11-23 20:49:38,759 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:38,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 20:49:38,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:38,868 INFO L377 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 [2019-11-23 20:49:38,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:38,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:38,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:38,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:49:39,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:39,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:39,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-23 20:49:39,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340268399] [2019-11-23 20:49:39,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:49:39,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:49:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:49:39,073 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 24 states. [2019-11-23 20:49:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:39,720 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-23 20:49:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 20:49:39,720 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2019-11-23 20:49:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:39,721 INFO L225 Difference]: With dead ends: 75 [2019-11-23 20:49:39,721 INFO L226 Difference]: Without dead ends: 73 [2019-11-23 20:49:39,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 20:49:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-23 20:49:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2019-11-23 20:49:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 20:49:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-11-23 20:49:39,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 36 [2019-11-23 20:49:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:39,732 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-11-23 20:49:39,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:49:39,732 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-11-23 20:49:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 20:49:39,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:39,733 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:39,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:39,944 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1209559974, now seen corresponding path program 8 times [2019-11-23 20:49:39,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:39,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413793531] [2019-11-23 20:49:39,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:40,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413793531] [2019-11-23 20:49:40,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712414146] [2019-11-23 20:49:40,217 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:40,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:49:40,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:40,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-23 20:49:40,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:40,414 INFO L377 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 15 treesize of output 11 [2019-11-23 20:49:40,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:40,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:40,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:40,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-23 20:49:40,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:40,500 INFO L377 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 31 treesize of output 24 [2019-11-23 20:49:40,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:40,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:40,511 INFO L496 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. [2019-11-23 20:49:40,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:38 [2019-11-23 20:49:41,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:41,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:41,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:41,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-11-23 20:49:41,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55785696] [2019-11-23 20:49:41,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:49:41,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:49:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=613, Unknown=1, NotChecked=0, Total=702 [2019-11-23 20:49:41,180 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 27 states. [2019-11-23 20:49:44,408 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-11-23 20:49:46,041 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-23 20:49:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:47,817 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-11-23 20:49:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-23 20:49:47,818 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2019-11-23 20:49:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:47,818 INFO L225 Difference]: With dead ends: 73 [2019-11-23 20:49:47,819 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 20:49:47,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=329, Invalid=2322, Unknown=1, NotChecked=0, Total=2652 [2019-11-23 20:49:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 20:49:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-11-23 20:49:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 20:49:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-23 20:49:47,827 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2019-11-23 20:49:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:47,828 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-23 20:49:47,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:49:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-23 20:49:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 20:49:47,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:47,829 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:48,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:48,030 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:48,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:48,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1942581397, now seen corresponding path program 9 times [2019-11-23 20:49:48,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:48,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018526914] [2019-11-23 20:49:48,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:48,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018526914] [2019-11-23 20:49:48,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306991907] [2019-11-23 20:49:48,131 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:48,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 20:49:48,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:48,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 20:49:48,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:48,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:48,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2019-11-23 20:49:48,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184317094] [2019-11-23 20:49:48,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 20:49:48,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:48,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 20:49:48,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:49:48,291 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 18 states. [2019-11-23 20:49:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:48,477 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-11-23 20:49:48,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:49:48,478 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-11-23 20:49:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:48,479 INFO L225 Difference]: With dead ends: 76 [2019-11-23 20:49:48,479 INFO L226 Difference]: Without dead ends: 49 [2019-11-23 20:49:48,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:49:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-23 20:49:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-11-23 20:49:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-23 20:49:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-11-23 20:49:48,487 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2019-11-23 20:49:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:48,488 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-11-23 20:49:48,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 20:49:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-11-23 20:49:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 20:49:48,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:48,489 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:48,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:48,693 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1613367984, now seen corresponding path program 10 times [2019-11-23 20:49:48,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:48,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274822187] [2019-11-23 20:49:48,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:48,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274822187] [2019-11-23 20:49:48,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994679079] [2019-11-23 20:49:48,959 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:48,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:49:48,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:48,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 20:49:49,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:49,123 INFO L377 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 [2019-11-23 20:49:49,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:49,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:49,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:49,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:49:49,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:49,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:49,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-11-23 20:49:49,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080767680] [2019-11-23 20:49:49,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 20:49:49,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 20:49:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:49:49,354 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 28 states. [2019-11-23 20:49:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:50,235 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2019-11-23 20:49:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 20:49:50,236 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2019-11-23 20:49:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:50,237 INFO L225 Difference]: With dead ends: 87 [2019-11-23 20:49:50,237 INFO L226 Difference]: Without dead ends: 85 [2019-11-23 20:49:50,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=1531, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 20:49:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-23 20:49:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-11-23 20:49:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 20:49:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-23 20:49:50,248 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2019-11-23 20:49:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:50,249 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-23 20:49:50,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-23 20:49:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-23 20:49:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 20:49:50,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:50,250 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:50,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:50,453 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:50,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:50,454 INFO L82 PathProgramCache]: Analyzing trace with hash 877372555, now seen corresponding path program 11 times [2019-11-23 20:49:50,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:50,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874321674] [2019-11-23 20:49:50,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:50,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874321674] [2019-11-23 20:49:50,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386118980] [2019-11-23 20:49:50,693 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:50,761 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-23 20:49:50,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:50,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-23 20:49:50,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:50,894 INFO L377 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 15 treesize of output 11 [2019-11-23 20:49:50,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:50,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:50,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:50,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-23 20:49:50,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:50,965 INFO L377 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 29 treesize of output 22 [2019-11-23 20:49:50,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:50,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:50,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:50,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:49:51,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:51,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:51,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-11-23 20:49:51,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276590611] [2019-11-23 20:49:51,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 20:49:51,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:51,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 20:49:51,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:49:51,301 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 31 states. [2019-11-23 20:49:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:53,577 INFO L93 Difference]: Finished difference Result 161 states and 167 transitions. [2019-11-23 20:49:53,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-11-23 20:49:53,577 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2019-11-23 20:49:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:53,578 INFO L225 Difference]: With dead ends: 161 [2019-11-23 20:49:53,578 INFO L226 Difference]: Without dead ends: 159 [2019-11-23 20:49:53,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=579, Invalid=5427, Unknown=0, NotChecked=0, Total=6006 [2019-11-23 20:49:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-23 20:49:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 73. [2019-11-23 20:49:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-23 20:49:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-11-23 20:49:53,594 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 48 [2019-11-23 20:49:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:53,594 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-11-23 20:49:53,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 20:49:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-11-23 20:49:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 20:49:53,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:53,596 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:53,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:53,800 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash 924773190, now seen corresponding path program 12 times [2019-11-23 20:49:53,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:53,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564261229] [2019-11-23 20:49:53,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:53,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564261229] [2019-11-23 20:49:53,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608197112] [2019-11-23 20:49:53,904 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:53,966 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-23 20:49:53,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:53,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 20:49:53,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:54,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:54,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2019-11-23 20:49:54,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607231740] [2019-11-23 20:49:54,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:49:54,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:54,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:49:54,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:49:54,121 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 21 states. [2019-11-23 20:49:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:54,360 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2019-11-23 20:49:54,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 20:49:54,361 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2019-11-23 20:49:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:54,362 INFO L225 Difference]: With dead ends: 144 [2019-11-23 20:49:54,362 INFO L226 Difference]: Without dead ends: 113 [2019-11-23 20:49:54,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:49:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-23 20:49:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 73. [2019-11-23 20:49:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-23 20:49:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-11-23 20:49:54,375 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 48 [2019-11-23 20:49:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:54,376 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-11-23 20:49:54,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:49:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-11-23 20:49:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 20:49:54,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:54,377 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:54,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:54,582 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:54,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1856864897, now seen corresponding path program 13 times [2019-11-23 20:49:54,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:54,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618242701] [2019-11-23 20:49:54,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 4 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:54,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618242701] [2019-11-23 20:49:54,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644513283] [2019-11-23 20:49:54,896 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:54,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-23 20:49:54,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:55,085 INFO L377 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 15 treesize of output 11 [2019-11-23 20:49:55,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:55,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:49:55,168 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:49:55,168 INFO L377 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 29 treesize of output 28 [2019-11-23 20:49:55,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:55,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-23 20:49:55,243 INFO L343 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-11-23 20:49:55,243 INFO L377 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2019-11-23 20:49:55,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:55,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-23 20:49:55,404 INFO L343 Elim1Store]: treesize reduction 68, result has 57.5 percent of original size [2019-11-23 20:49:55,405 INFO L377 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 110 [2019-11-23 20:49:55,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,443 INFO L567 ElimStorePlain]: treesize reduction 82, result has 35.9 percent of original size [2019-11-23 20:49:55,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-11-23 20:49:55,602 INFO L343 Elim1Store]: treesize reduction 120, result has 52.0 percent of original size [2019-11-23 20:49:55,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 150 [2019-11-23 20:49:55,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,644 INFO L567 ElimStorePlain]: treesize reduction 108, result has 26.5 percent of original size [2019-11-23 20:49:55,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:39 [2019-11-23 20:49:55,793 INFO L343 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2019-11-23 20:49:55,794 INFO L377 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 46 [2019-11-23 20:49:55,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:55,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:55,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:58 [2019-11-23 20:49:56,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:56,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:56,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 39 [2019-11-23 20:49:56,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982675435] [2019-11-23 20:49:56,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-23 20:49:56,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:56,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-23 20:49:56,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 20:49:56,236 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 39 states. [2019-11-23 20:49:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:59,904 INFO L93 Difference]: Finished difference Result 180 states and 189 transitions. [2019-11-23 20:49:59,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-11-23 20:49:59,905 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 56 [2019-11-23 20:49:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:59,906 INFO L225 Difference]: With dead ends: 180 [2019-11-23 20:49:59,906 INFO L226 Difference]: Without dead ends: 178 [2019-11-23 20:49:59,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2584 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=708, Invalid=7482, Unknown=0, NotChecked=0, Total=8190 [2019-11-23 20:49:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-23 20:49:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-23 20:49:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-23 20:49:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2019-11-23 20:49:59,926 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 56 [2019-11-23 20:49:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:59,926 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2019-11-23 20:49:59,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-23 20:49:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2019-11-23 20:49:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 20:49:59,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:59,928 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:00,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:00,132 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1904265532, now seen corresponding path program 14 times [2019-11-23 20:50:00,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:00,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515820921] [2019-11-23 20:50:00,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:00,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515820921] [2019-11-23 20:50:00,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041750097] [2019-11-23 20:50:00,398 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:00,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:50:00,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:00,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-23 20:50:00,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:00,641 INFO L377 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 15 treesize of output 11 [2019-11-23 20:50:00,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:00,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:00,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:00,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-23 20:50:00,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:00,717 INFO L377 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 31 treesize of output 24 [2019-11-23 20:50:00,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:00,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:00,728 INFO L496 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. [2019-11-23 20:50:00,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2019-11-23 20:50:00,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:01,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:01,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:01,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2019-11-23 20:50:01,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706660228] [2019-11-23 20:50:01,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-23 20:50:01,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:01,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-23 20:50:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 20:50:01,246 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 35 states. [2019-11-23 20:50:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:04,813 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2019-11-23 20:50:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-23 20:50:04,814 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 56 [2019-11-23 20:50:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:04,815 INFO L225 Difference]: With dead ends: 148 [2019-11-23 20:50:04,815 INFO L226 Difference]: Without dead ends: 146 [2019-11-23 20:50:04,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=462, Invalid=4650, Unknown=0, NotChecked=0, Total=5112 [2019-11-23 20:50:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-23 20:50:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 85. [2019-11-23 20:50:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-23 20:50:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2019-11-23 20:50:04,829 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 56 [2019-11-23 20:50:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:04,829 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2019-11-23 20:50:04,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-23 20:50:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2019-11-23 20:50:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 20:50:04,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:04,830 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:05,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:05,031 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1215546761, now seen corresponding path program 15 times [2019-11-23 20:50:05,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:05,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505227462] [2019-11-23 20:50:05,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 51 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:05,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505227462] [2019-11-23 20:50:05,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305780926] [2019-11-23 20:50:05,165 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:05,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-23 20:50:05,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:05,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 20:50:05,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 72 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:05,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:05,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2019-11-23 20:50:05,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409423677] [2019-11-23 20:50:05,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:50:05,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:05,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:50:05,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:50:05,403 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 24 states. [2019-11-23 20:50:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:05,688 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2019-11-23 20:50:05,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 20:50:05,689 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-11-23 20:50:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:05,689 INFO L225 Difference]: With dead ends: 144 [2019-11-23 20:50:05,689 INFO L226 Difference]: Without dead ends: 109 [2019-11-23 20:50:05,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:50:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-23 20:50:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2019-11-23 20:50:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-23 20:50:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-11-23 20:50:05,704 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 56 [2019-11-23 20:50:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:05,704 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-11-23 20:50:05,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:50:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-11-23 20:50:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 20:50:05,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:05,705 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:05,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:05,915 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash -836376270, now seen corresponding path program 16 times [2019-11-23 20:50:05,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:05,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831593187] [2019-11-23 20:50:05,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:06,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831593187] [2019-11-23 20:50:06,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40268350] [2019-11-23 20:50:06,204 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:06,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:50:06,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:06,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-23 20:50:06,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:06,410 INFO L377 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 [2019-11-23 20:50:06,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:06,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:06,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:06,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:50:06,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:06,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:06,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-11-23 20:50:06,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308018457] [2019-11-23 20:50:06,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-23 20:50:06,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:06,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-23 20:50:06,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 20:50:06,792 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 36 states. [2019-11-23 20:50:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:07,966 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2019-11-23 20:50:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-23 20:50:07,967 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 60 [2019-11-23 20:50:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:07,968 INFO L225 Difference]: With dead ends: 128 [2019-11-23 20:50:07,968 INFO L226 Difference]: Without dead ends: 126 [2019-11-23 20:50:07,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=2621, Unknown=0, NotChecked=0, Total=2862 [2019-11-23 20:50:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-23 20:50:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 89. [2019-11-23 20:50:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-23 20:50:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-11-23 20:50:07,981 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 60 [2019-11-23 20:50:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:07,982 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-11-23 20:50:07,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-23 20:50:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-11-23 20:50:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-23 20:50:07,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:07,982 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:08,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:08,183 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:08,184 INFO L82 PathProgramCache]: Analyzing trace with hash 313400872, now seen corresponding path program 17 times [2019-11-23 20:50:08,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:08,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132066871] [2019-11-23 20:50:08,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 73 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:08,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132066871] [2019-11-23 20:50:08,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663974490] [2019-11-23 20:50:08,347 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:08,480 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-23 20:50:08,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:08,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 20:50:08,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 98 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:08,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:50:08,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2019-11-23 20:50:08,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356354857] [2019-11-23 20:50:08,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:50:08,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:50:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:50:08,675 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 27 states. [2019-11-23 20:50:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:08,963 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2019-11-23 20:50:08,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 20:50:08,965 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2019-11-23 20:50:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:08,966 INFO L225 Difference]: With dead ends: 154 [2019-11-23 20:50:08,966 INFO L226 Difference]: Without dead ends: 115 [2019-11-23 20:50:08,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=907, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 20:50:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-23 20:50:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2019-11-23 20:50:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-23 20:50:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-11-23 20:50:08,979 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 64 [2019-11-23 20:50:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:08,979 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-11-23 20:50:08,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:50:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-11-23 20:50:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 20:50:08,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:08,980 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:09,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:09,181 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash 247919715, now seen corresponding path program 18 times [2019-11-23 20:50:09,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:09,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758075945] [2019-11-23 20:50:09,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 4 proven. 258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:09,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758075945] [2019-11-23 20:50:09,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051881996] [2019-11-23 20:50:09,649 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:09,813 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-11-23 20:50:09,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:50:09,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-23 20:50:09,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:10,003 INFO L377 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 15 treesize of output 11 [2019-11-23 20:50:10,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-23 20:50:10,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,092 INFO L377 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 26 treesize of output 25 [2019-11-23 20:50:10,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-23 20:50:10,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,167 INFO L377 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 37 treesize of output 39 [2019-11-23 20:50:10,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-23 20:50:10,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,297 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2019-11-23 20:50:10,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,318 INFO L496 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. [2019-11-23 20:50:10,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2019-11-23 20:50:10,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:10,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:10,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 104 [2019-11-23 20:50:10,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:10,462 INFO L567 ElimStorePlain]: treesize reduction 26, result has 76.1 percent of original size [2019-11-23 20:50:10,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:10,464 INFO L496 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. [2019-11-23 20:50:10,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:83 [2019-11-23 20:50:10,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:10,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:15,903 WARN L192 SmtUtils]: Spent 5.28 s on a formula simplification that was a NOOP. DAG size: 50 [2019-11-23 20:50:16,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:16,079 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_int_34|], 30=[v_prenex_8]} [2019-11-23 20:50:16,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 67 [2019-11-23 20:50:16,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:16,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:50:16,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:50:16,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 154 [2019-11-23 20:50:16,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:50:16,337 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-23 20:50:16,338 INFO L567 ElimStorePlain]: treesize reduction 66, result has 74.9 percent of original size [2019-11-23 20:50:16,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:16,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-23 20:50:16,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:186, output treesize:197 [2019-11-23 20:50:16,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:50:34,015 WARN L192 SmtUtils]: Spent 15.14 s on a formula simplification that was a NOOP. DAG size: 71 [2019-11-23 20:50:34,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms