/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/heap-data/min_max.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:30:08,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:30:08,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:30:08,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:30:08,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:30:08,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:30:08,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:30:08,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:30:08,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:30:08,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:30:08,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:30:08,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:30:08,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:30:08,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:30:08,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:30:08,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:30:08,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:30:08,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:30:08,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:30:08,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:30:08,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:30:08,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:30:08,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:30:08,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:30:08,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:30:08,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:30:08,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:30:08,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:30:08,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:30:08,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:30:08,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:30:08,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:30:08,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:30:08,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:30:08,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:30:08,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:30:08,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:30:08,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:30:08,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:30:08,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:30:08,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:30:08,111 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 21:30:08,125 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:30:08,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:30:08,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:30:08,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:30:08,127 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:30:08,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:30:08,127 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:30:08,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:30:08,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:30:08,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:30:08,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:30:08,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:30:08,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:30:08,129 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:30:08,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:30:08,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:30:08,129 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:30:08,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:30:08,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:30:08,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:30:08,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:30:08,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:30:08,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:30:08,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:30:08,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:30:08,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:30:08,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:30:08,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:30:08,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:30:08,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:30:08,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:30:08,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:30:08,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:30:08,419 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:30:08,420 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:30:08,421 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/min_max.i [2019-11-23 21:30:08,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f59131ad/e2f075ef012a418ca41f2ae1f7332785/FLAG3cc960937 [2019-11-23 21:30:09,007 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:30:09,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max.i [2019-11-23 21:30:09,024 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f59131ad/e2f075ef012a418ca41f2ae1f7332785/FLAG3cc960937 [2019-11-23 21:30:09,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f59131ad/e2f075ef012a418ca41f2ae1f7332785 [2019-11-23 21:30:09,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:30:09,294 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:30:09,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:30:09,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:30:09,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:30:09,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276043b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09, skipping insertion in model container [2019-11-23 21:30:09,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:30:09,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:30:09,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:30:09,837 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:30:09,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:30:09,924 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:30:09,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09 WrapperNode [2019-11-23 21:30:09,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:30:09,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:30:09,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:30:09,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:30:09,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:30:09,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:30:09,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:30:09,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:30:09,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (1/1) ... [2019-11-23 21:30:09,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:30:10,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:30:10,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:30:10,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:30:10,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (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 21:30:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:30:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:30:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:30:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:30:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:30:10,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:30:10,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:30:10,396 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:30:10,397 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-23 21:30:10,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:30:10 BoogieIcfgContainer [2019-11-23 21:30:10,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:30:10,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:30:10,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:30:10,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:30:10,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:30:09" (1/3) ... [2019-11-23 21:30:10,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c2b624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:30:10, skipping insertion in model container [2019-11-23 21:30:10,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:09" (2/3) ... [2019-11-23 21:30:10,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c2b624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:30:10, skipping insertion in model container [2019-11-23 21:30:10,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:30:10" (3/3) ... [2019-11-23 21:30:10,407 INFO L109 eAbstractionObserver]: Analyzing ICFG min_max.i [2019-11-23 21:30:10,418 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:30:10,427 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-23 21:30:10,436 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-23 21:30:10,456 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:30:10,456 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:30:10,456 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:30:10,457 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:30:10,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:30:10,457 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:30:10,457 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:30:10,457 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:30:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-23 21:30:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-23 21:30:10,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:10,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:10,476 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1825905474, now seen corresponding path program 1 times [2019-11-23 21:30:10,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:10,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287018700] [2019-11-23 21:30:10,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:10,620 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 21:30:10,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287018700] [2019-11-23 21:30:10,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:10,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:30:10,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883000019] [2019-11-23 21:30:10,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:30:10,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:10,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:30:10,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:30:10,647 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-23 21:30:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:10,665 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-23 21:30:10,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:30:10,667 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-11-23 21:30:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:10,675 INFO L225 Difference]: With dead ends: 33 [2019-11-23 21:30:10,675 INFO L226 Difference]: Without dead ends: 17 [2019-11-23 21:30:10,679 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 21:30:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-23 21:30:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-23 21:30:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-23 21:30:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-23 21:30:10,716 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 7 [2019-11-23 21:30:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:10,717 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-23 21:30:10,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:30:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-23 21:30:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 21:30:10,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:10,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:10,719 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:10,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash 178093936, now seen corresponding path program 1 times [2019-11-23 21:30:10,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:10,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456701048] [2019-11-23 21:30:10,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:10,811 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 21:30:10,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456701048] [2019-11-23 21:30:10,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:10,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:30:10,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460409864] [2019-11-23 21:30:10,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:30:10,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:10,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:30:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:30:10,815 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2019-11-23 21:30:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:10,874 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-11-23 21:30:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:30:10,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-23 21:30:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:10,876 INFO L225 Difference]: With dead ends: 30 [2019-11-23 21:30:10,876 INFO L226 Difference]: Without dead ends: 19 [2019-11-23 21:30:10,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:30:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-23 21:30:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-23 21:30:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-23 21:30:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-23 21:30:10,883 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 8 [2019-11-23 21:30:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:10,884 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-23 21:30:10,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:30:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-23 21:30:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 21:30:10,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:10,885 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:10,886 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1651856839, now seen corresponding path program 1 times [2019-11-23 21:30:10,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:10,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550459022] [2019-11-23 21:30:10,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:11,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550459022] [2019-11-23 21:30:11,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:11,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 21:30:11,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636788444] [2019-11-23 21:30:11,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:30:11,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:11,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:30:11,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:30:11,152 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 7 states. [2019-11-23 21:30:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:11,298 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-11-23 21:30:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:30:11,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-23 21:30:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:11,301 INFO L225 Difference]: With dead ends: 28 [2019-11-23 21:30:11,301 INFO L226 Difference]: Without dead ends: 26 [2019-11-23 21:30:11,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:30:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-23 21:30:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-11-23 21:30:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 21:30:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-23 21:30:11,314 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2019-11-23 21:30:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:11,316 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-23 21:30:11,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:30:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-23 21:30:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 21:30:11,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:11,318 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:11,319 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:11,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1703602811, now seen corresponding path program 1 times [2019-11-23 21:30:11,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:11,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029235557] [2019-11-23 21:30:11,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:11,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029235557] [2019-11-23 21:30:11,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:11,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 21:30:11,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196291176] [2019-11-23 21:30:11,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:30:11,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:11,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:30:11,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:30:11,552 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 8 states. [2019-11-23 21:30:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:11,779 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-23 21:30:11,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 21:30:11,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-23 21:30:11,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:11,782 INFO L225 Difference]: With dead ends: 40 [2019-11-23 21:30:11,782 INFO L226 Difference]: Without dead ends: 38 [2019-11-23 21:30:11,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:30:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-23 21:30:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-11-23 21:30:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 21:30:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-23 21:30:11,796 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2019-11-23 21:30:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:11,796 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-23 21:30:11,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:30:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-23 21:30:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 21:30:11,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:11,798 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:11,799 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:11,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1911306115, now seen corresponding path program 1 times [2019-11-23 21:30:11,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:11,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881851878] [2019-11-23 21:30:11,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:11,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881851878] [2019-11-23 21:30:11,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:11,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:30:11,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429321751] [2019-11-23 21:30:11,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:30:11,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:11,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:30:11,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:30:11,910 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-11-23 21:30:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:11,991 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-11-23 21:30:11,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:30:11,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-23 21:30:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:11,993 INFO L225 Difference]: With dead ends: 55 [2019-11-23 21:30:11,994 INFO L226 Difference]: Without dead ends: 31 [2019-11-23 21:30:11,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:30:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-23 21:30:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-23 21:30:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-23 21:30:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-23 21:30:12,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 15 [2019-11-23 21:30:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:12,001 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-23 21:30:12,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:30:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-23 21:30:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 21:30:12,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:12,002 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:12,002 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1682596603, now seen corresponding path program 1 times [2019-11-23 21:30:12,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:12,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273811434] [2019-11-23 21:30:12,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:12,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273811434] [2019-11-23 21:30:12,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:12,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 21:30:12,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658562445] [2019-11-23 21:30:12,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:30:12,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:30:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:30:12,184 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 9 states. [2019-11-23 21:30:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:12,405 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-11-23 21:30:12,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:30:12,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-23 21:30:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:12,407 INFO L225 Difference]: With dead ends: 36 [2019-11-23 21:30:12,407 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 21:30:12,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:30:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 21:30:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2019-11-23 21:30:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 21:30:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-23 21:30:12,415 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2019-11-23 21:30:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:12,418 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-23 21:30:12,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:30:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-23 21:30:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 21:30:12,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:12,419 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:12,419 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:12,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:12,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1593313461, now seen corresponding path program 1 times [2019-11-23 21:30:12,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:12,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026459209] [2019-11-23 21:30:12,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:12,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026459209] [2019-11-23 21:30:12,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906839901] [2019-11-23 21:30:12,547 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 21:30:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:12,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 21:30:12,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:12,716 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 11 treesize of output 7 [2019-11-23 21:30:12,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:12,730 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 11 treesize of output 7 [2019-11-23 21:30:12,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:12,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,739 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-23 21:30:12,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:12,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:12,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:12,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:12,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,772 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-23 21:30:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:12,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:12,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-11-23 21:30:12,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228909183] [2019-11-23 21:30:12,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:30:12,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:12,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:30:12,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:30:12,778 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2019-11-23 21:30:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:12,892 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-11-23 21:30:12,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:30:12,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-23 21:30:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:12,893 INFO L225 Difference]: With dead ends: 46 [2019-11-23 21:30:12,893 INFO L226 Difference]: Without dead ends: 30 [2019-11-23 21:30:12,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:30:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-23 21:30:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-23 21:30:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:30:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-23 21:30:12,899 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2019-11-23 21:30:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:12,899 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-23 21:30:12,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:30:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-11-23 21:30:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 21:30:12,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:12,900 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:13,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:13,104 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1667695916, now seen corresponding path program 2 times [2019-11-23 21:30:13,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:13,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489125984] [2019-11-23 21:30:13,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:30:13,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489125984] [2019-11-23 21:30:13,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557667706] [2019-11-23 21:30:13,213 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 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 21:30:13,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:30:13,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:13,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:30:13,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:13,406 INFO L343 Elim1Store]: treesize reduction 81, result has 33.1 percent of original size [2019-11-23 21:30:13,407 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 2 case distinctions, treesize of input 39 treesize of output 46 [2019-11-23 21:30:13,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:13,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:13,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:13,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:13,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:33 [2019-11-23 21:30:13,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-23 21:30:13,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:13,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:13,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:13,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-11-23 21:30:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:30:13,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:13,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-11-23 21:30:13,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899616658] [2019-11-23 21:30:13,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:30:13,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:13,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:30:13,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:30:13,536 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 13 states. [2019-11-23 21:30:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:13,891 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2019-11-23 21:30:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 21:30:13,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-23 21:30:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:13,895 INFO L225 Difference]: With dead ends: 107 [2019-11-23 21:30:13,895 INFO L226 Difference]: Without dead ends: 88 [2019-11-23 21:30:13,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:30:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-23 21:30:13,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 37. [2019-11-23 21:30:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-23 21:30:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-11-23 21:30:13,904 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 23 [2019-11-23 21:30:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:13,904 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-11-23 21:30:13,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:30:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-11-23 21:30:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 21:30:13,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:13,905 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:14,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:14,109 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:14,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1409530478, now seen corresponding path program 1 times [2019-11-23 21:30:14,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:14,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352560121] [2019-11-23 21:30:14,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:14,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352560121] [2019-11-23 21:30:14,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784337188] [2019-11-23 21:30:14,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:30:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:14,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 21:30:14,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:14,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:14,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:14,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-11-23 21:30:14,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:14,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:14,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:14,541 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_7|, |v_#memory_$Pointer$.base_7|], 4=[|v_#memory_int_10|]} [2019-11-23 21:30:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:14,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:14,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:14,573 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:14,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:14,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:30:14,595 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:14,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,608 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-11-23 21:30:14,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-23 21:30:14,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:14,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:14,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:14,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,685 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-23 21:30:14,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:14,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:14,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:14,703 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 21:30:14,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:30:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:14,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:14,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-11-23 21:30:14,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829246853] [2019-11-23 21:30:14,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:30:14,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:14,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:30:14,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:30:14,708 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 13 states. [2019-11-23 21:30:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:15,321 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-11-23 21:30:15,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:30:15,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-23 21:30:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:15,324 INFO L225 Difference]: With dead ends: 47 [2019-11-23 21:30:15,324 INFO L226 Difference]: Without dead ends: 45 [2019-11-23 21:30:15,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:30:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-23 21:30:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-11-23 21:30:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-23 21:30:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-11-23 21:30:15,331 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 23 [2019-11-23 21:30:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:15,332 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-11-23 21:30:15,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:30:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-11-23 21:30:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:30:15,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:15,333 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:15,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:15,534 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:15,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1643965548, now seen corresponding path program 1 times [2019-11-23 21:30:15,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:15,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897593501] [2019-11-23 21:30:15,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:15,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897593501] [2019-11-23 21:30:15,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368952202] [2019-11-23 21:30:15,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:30:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:15,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 21:30:15,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:15,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:15,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:15,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:15,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,904 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_8|, |v_#memory_$Pointer$.base_8|], 4=[|v_#memory_int_11|]} [2019-11-23 21:30:15,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:15,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:15,933 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:15,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:30:15,953 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,967 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-11-23 21:30:16,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-23 21:30:16,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:16,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:16,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:16,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:16,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:16,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:16,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-23 21:30:16,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:16,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:16,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:16,056 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 21:30:16,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:30:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:16,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:16,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 14 [2019-11-23 21:30:16,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160817465] [2019-11-23 21:30:16,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:30:16,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:16,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:30:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:30:16,061 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 14 states. [2019-11-23 21:30:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:16,883 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2019-11-23 21:30:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 21:30:16,883 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-23 21:30:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:16,884 INFO L225 Difference]: With dead ends: 93 [2019-11-23 21:30:16,885 INFO L226 Difference]: Without dead ends: 91 [2019-11-23 21:30:16,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:30:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-23 21:30:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2019-11-23 21:30:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-23 21:30:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2019-11-23 21:30:16,894 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 25 [2019-11-23 21:30:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:16,895 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2019-11-23 21:30:16,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:30:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2019-11-23 21:30:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:30:16,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:16,896 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:17,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:17,099 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1055550124, now seen corresponding path program 1 times [2019-11-23 21:30:17,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:17,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12313191] [2019-11-23 21:30:17,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:17,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12313191] [2019-11-23 21:30:17,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128768002] [2019-11-23 21:30:17,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:30:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:17,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 21:30:17,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:17,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:17,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:17,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:17,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,439 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_9|, |v_#memory_$Pointer$.base_9|], 4=[|v_#memory_int_12|]} [2019-11-23 21:30:17,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:17,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:17,490 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:17,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:30:17,517 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,531 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:33 [2019-11-23 21:30:17,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-23 21:30:17,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:17,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:17,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2019-11-23 21:30:17,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2019-11-23 21:30:17,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-11-23 21:30:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:17,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:17,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2019-11-23 21:30:17,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395227108] [2019-11-23 21:30:17,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:30:17,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:17,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:30:17,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:30:17,770 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand 18 states. [2019-11-23 21:30:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:18,751 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2019-11-23 21:30:18,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 21:30:18,751 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-11-23 21:30:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:18,752 INFO L225 Difference]: With dead ends: 114 [2019-11-23 21:30:18,752 INFO L226 Difference]: Without dead ends: 112 [2019-11-23 21:30:18,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2019-11-23 21:30:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-23 21:30:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 66. [2019-11-23 21:30:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-23 21:30:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2019-11-23 21:30:18,771 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 25 [2019-11-23 21:30:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:18,772 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2019-11-23 21:30:18,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:30:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2019-11-23 21:30:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:30:18,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:18,776 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:18,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:18,980 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1550473430, now seen corresponding path program 1 times [2019-11-23 21:30:18,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:18,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044887843] [2019-11-23 21:30:18,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:19,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044887843] [2019-11-23 21:30:19,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182398079] [2019-11-23 21:30:19,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:30:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:19,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 21:30:19,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:19,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:19,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:19,418 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:19,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,447 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_10|, |v_#memory_$Pointer$.base_10|], 4=[|v_#memory_int_13|]} [2019-11-23 21:30:19,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:19,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:19,488 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:19,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:30:19,522 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,558 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:75, output treesize:42 [2019-11-23 21:30:19,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-11-23 21:30:19,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:19,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:19,762 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:30 [2019-11-23 21:30:19,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-23 21:30:19,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-23 21:30:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:19,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:19,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2019-11-23 21:30:19,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926798806] [2019-11-23 21:30:19,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 21:30:19,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:19,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 21:30:19,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:30:19,849 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 22 states. [2019-11-23 21:30:21,868 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-11-23 21:30:22,437 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-11-23 21:30:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:23,716 INFO L93 Difference]: Finished difference Result 220 states and 252 transitions. [2019-11-23 21:30:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-23 21:30:23,717 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-11-23 21:30:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:23,718 INFO L225 Difference]: With dead ends: 220 [2019-11-23 21:30:23,719 INFO L226 Difference]: Without dead ends: 218 [2019-11-23 21:30:23,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2019-11-23 21:30:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-23 21:30:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 82. [2019-11-23 21:30:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-23 21:30:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2019-11-23 21:30:23,754 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 25 [2019-11-23 21:30:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:23,756 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2019-11-23 21:30:23,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 21:30:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2019-11-23 21:30:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:30:23,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:23,757 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:23,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:23,960 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1560424534, now seen corresponding path program 1 times [2019-11-23 21:30:23,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:23,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010365503] [2019-11-23 21:30:23,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:24,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010365503] [2019-11-23 21:30:24,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393669345] [2019-11-23 21:30:24,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:30:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:24,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 21:30:24,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:24,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:24,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:24,276 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:24,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,293 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_11|, |v_#memory_$Pointer$.base_11|], 4=[|v_#memory_int_14|]} [2019-11-23 21:30:24,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:24,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:24,314 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:24,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:30:24,332 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,347 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:27 [2019-11-23 21:30:24,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-23 21:30:24,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:24,406 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,411 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-23 21:30:24,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:24,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,443 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 21:30:24,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:30:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:24,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:24,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2019-11-23 21:30:24,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562998245] [2019-11-23 21:30:24,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 21:30:24,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:24,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 21:30:24,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:30:24,451 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 15 states. [2019-11-23 21:30:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:25,504 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2019-11-23 21:30:25,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:30:25,504 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-11-23 21:30:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:25,506 INFO L225 Difference]: With dead ends: 106 [2019-11-23 21:30:25,506 INFO L226 Difference]: Without dead ends: 104 [2019-11-23 21:30:25,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-11-23 21:30:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-23 21:30:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 42. [2019-11-23 21:30:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 21:30:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-11-23 21:30:25,513 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 25 [2019-11-23 21:30:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:25,513 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-11-23 21:30:25,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 21:30:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-11-23 21:30:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 21:30:25,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:25,515 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:25,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:25,718 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:25,718 INFO L82 PathProgramCache]: Analyzing trace with hash 138316690, now seen corresponding path program 2 times [2019-11-23 21:30:25,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:25,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434652455] [2019-11-23 21:30:25,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:25,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434652455] [2019-11-23 21:30:25,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973759286] [2019-11-23 21:30:25,862 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 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 21:30:25,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:30:25,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:25,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 21:30:25,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:25,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:25,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:25,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:25,938 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 11 treesize of output 7 [2019-11-23 21:30:25,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:25,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:25,949 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 11 treesize of output 7 [2019-11-23 21:30:25,949 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:25,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:25,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:25,960 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-11-23 21:30:25,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:25,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:25,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:26,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,010 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:26,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:26,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-23 21:30:26,036 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:26,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,062 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 27 treesize of output 11 [2019-11-23 21:30:26,062 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:26,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,080 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 19 treesize of output 18 [2019-11-23 21:30:26,080 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:26,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:26,097 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:39 [2019-11-23 21:30:26,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-11-23 21:30:26,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,183 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:26,198 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-23 21:30:26,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-23 21:30:26,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:26,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:26,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-11-23 21:30:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:26,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:26,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-11-23 21:30:26,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900364293] [2019-11-23 21:30:26,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:30:26,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:26,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:30:26,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:30:26,215 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 13 states. [2019-11-23 21:30:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:26,553 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-11-23 21:30:26,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 21:30:26,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-23 21:30:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:26,554 INFO L225 Difference]: With dead ends: 73 [2019-11-23 21:30:26,554 INFO L226 Difference]: Without dead ends: 52 [2019-11-23 21:30:26,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:30:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-23 21:30:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-23 21:30:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-23 21:30:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-11-23 21:30:26,567 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 28 [2019-11-23 21:30:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:26,567 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-11-23 21:30:26,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:30:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-11-23 21:30:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 21:30:26,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:26,569 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:26,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:26,776 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:26,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash -334041831, now seen corresponding path program 3 times [2019-11-23 21:30:26,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:26,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880364153] [2019-11-23 21:30:26,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:27,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880364153] [2019-11-23 21:30:27,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796986123] [2019-11-23 21:30:27,051 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 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 21:30:27,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 21:30:27,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:27,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-23 21:30:27,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:27,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:27,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-11-23 21:30:27,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:30:27,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,241 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-11-23 21:30:27,243 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_15|, |v_#memory_$Pointer$.offset_15|], 4=[|v_#memory_int_15|]} [2019-11-23 21:30:27,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:27,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:27,275 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:27,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:30:27,306 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,323 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-11-23 21:30:27,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:30:27,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,438 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_17|, |v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_17|, |v_#memory_$Pointer$.offset_16|], 4=[|v_#memory_int_16|]} [2019-11-23 21:30:27,452 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 47 treesize of output 23 [2019-11-23 21:30:27,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,523 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 39 treesize of output 30 [2019-11-23 21:30:27,523 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,585 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-11-23 21:30:27,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:27,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:30:27,595 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:27,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:30:27,623 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:27,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-11-23 21:30:27,651 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,672 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:129, output treesize:65 [2019-11-23 21:30:27,817 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-23 21:30:27,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 51 [2019-11-23 21:30:27,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:27,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:27,821 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:27,851 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.8 percent of original size [2019-11-23 21:30:27,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-23 21:30:27,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,869 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:11 [2019-11-23 21:30:27,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:27,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:27,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:27,887 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 21:30:27,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:30:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:27,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:27,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2019-11-23 21:30:27,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861891093] [2019-11-23 21:30:27,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:30:27,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:27,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:30:27,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:30:27,896 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 18 states. [2019-11-23 21:30:28,591 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-11-23 21:30:28,804 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2019-11-23 21:30:28,956 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-11-23 21:30:29,107 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-11-23 21:30:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:29,421 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2019-11-23 21:30:29,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 21:30:29,421 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-11-23 21:30:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:29,423 INFO L225 Difference]: With dead ends: 62 [2019-11-23 21:30:29,423 INFO L226 Difference]: Without dead ends: 60 [2019-11-23 21:30:29,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2019-11-23 21:30:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-23 21:30:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2019-11-23 21:30:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 21:30:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-11-23 21:30:29,430 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 33 [2019-11-23 21:30:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:29,430 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-23 21:30:29,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:30:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-11-23 21:30:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:30:29,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:29,431 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:29,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:29,635 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1108473179, now seen corresponding path program 2 times [2019-11-23 21:30:29,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:29,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015800149] [2019-11-23 21:30:29,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:29,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015800149] [2019-11-23 21:30:29,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985060794] [2019-11-23 21:30:29,894 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 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 21:30:29,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:30:29,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:29,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-23 21:30:29,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:30,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:30,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:30,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:30:30,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,158 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-11-23 21:30:30,160 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_18|], 4=[|v_#memory_int_17|]} [2019-11-23 21:30:30,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:30,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:30,204 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:30,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:30:30,228 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,246 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-11-23 21:30:30,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:30:30,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,338 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|], 4=[|v_#memory_int_18|]} [2019-11-23 21:30:30,342 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:30,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,379 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:30,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:30,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-23 21:30:30,417 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:30,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-23 21:30:30,449 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:30,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-11-23 21:30:30,482 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,506 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:126, output treesize:79 [2019-11-23 21:30:30,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 64 [2019-11-23 21:30:30,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:30,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:30,645 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:30,670 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size [2019-11-23 21:30:30,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-23 21:30:30,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,684 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:11 [2019-11-23 21:30:30,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:30,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:30,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:30,715 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 21:30:30,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:30:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:30,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:30,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2019-11-23 21:30:30,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573554639] [2019-11-23 21:30:30,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 21:30:30,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:30,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 21:30:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:30:30,728 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 19 states. [2019-11-23 21:30:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:32,333 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2019-11-23 21:30:32,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:30:32,333 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-11-23 21:30:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:32,334 INFO L225 Difference]: With dead ends: 152 [2019-11-23 21:30:32,334 INFO L226 Difference]: Without dead ends: 150 [2019-11-23 21:30:32,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 21:30:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-23 21:30:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 96. [2019-11-23 21:30:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-23 21:30:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2019-11-23 21:30:32,355 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 35 [2019-11-23 21:30:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:32,357 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2019-11-23 21:30:32,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 21:30:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2019-11-23 21:30:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:30:32,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:32,359 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:32,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:32,561 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:32,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:32,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2065136743, now seen corresponding path program 2 times [2019-11-23 21:30:32,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:32,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974486536] [2019-11-23 21:30:32,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:32,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974486536] [2019-11-23 21:30:32,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936552640] [2019-11-23 21:30:32,924 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 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 21:30:32,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:30:32,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:32,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-23 21:30:32,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:32,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:32,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:33,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:30:33,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,120 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-11-23 21:30:33,121 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|], 4=[|v_#memory_int_19|]} [2019-11-23 21:30:33,127 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:33,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:33,156 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:33,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:30:33,181 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,196 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-11-23 21:30:33,276 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:30:33,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,333 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_22|], 4=[|v_#memory_int_20|]} [2019-11-23 21:30:33,344 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 47 treesize of output 23 [2019-11-23 21:30:33,344 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,404 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:33,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:33,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-23 21:30:33,447 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,487 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 39 treesize of output 30 [2019-11-23 21:30:33,487 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:33,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-11-23 21:30:33,529 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,556 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:141, output treesize:94 [2019-11-23 21:30:33,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 70 [2019-11-23 21:30:33,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:33,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:33,951 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:33,983 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2019-11-23 21:30:33,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-23 21:30:33,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:34,000 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:124, output treesize:30 [2019-11-23 21:30:34,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-23 21:30:34,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:34,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:34,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-23 21:30:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:34,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:34,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2019-11-23 21:30:34,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782878298] [2019-11-23 21:30:34,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 21:30:34,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:34,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 21:30:34,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-11-23 21:30:34,117 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand 26 states. [2019-11-23 21:30:37,217 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-23 21:30:37,975 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-11-23 21:30:38,687 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 76 [2019-11-23 21:30:39,124 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-11-23 21:30:39,381 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2019-11-23 21:30:39,606 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2019-11-23 21:30:40,487 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2019-11-23 21:30:40,698 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-11-23 21:30:40,972 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-11-23 21:30:41,223 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2019-11-23 21:30:41,666 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 86 [2019-11-23 21:30:42,354 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 88 [2019-11-23 21:30:42,546 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2019-11-23 21:30:43,004 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-11-23 21:30:43,673 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-11-23 21:30:43,842 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-11-23 21:30:44,069 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-11-23 21:30:44,244 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-23 21:30:44,472 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2019-11-23 21:30:44,744 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 73 [2019-11-23 21:30:45,279 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 75 [2019-11-23 21:30:45,475 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-11-23 21:30:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:46,315 INFO L93 Difference]: Finished difference Result 791 states and 873 transitions. [2019-11-23 21:30:46,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-11-23 21:30:46,316 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2019-11-23 21:30:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:46,320 INFO L225 Difference]: With dead ends: 791 [2019-11-23 21:30:46,320 INFO L226 Difference]: Without dead ends: 789 [2019-11-23 21:30:46,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1227, Invalid=8085, Unknown=0, NotChecked=0, Total=9312 [2019-11-23 21:30:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-11-23 21:30:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 166. [2019-11-23 21:30:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-23 21:30:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 221 transitions. [2019-11-23 21:30:46,348 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 221 transitions. Word has length 35 [2019-11-23 21:30:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:46,348 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 221 transitions. [2019-11-23 21:30:46,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 21:30:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 221 transitions. [2019-11-23 21:30:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:30:46,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:46,349 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:46,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:46,553 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:46,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:46,553 INFO L82 PathProgramCache]: Analyzing trace with hash 540886811, now seen corresponding path program 2 times [2019-11-23 21:30:46,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:46,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593843323] [2019-11-23 21:30:46,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:46,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593843323] [2019-11-23 21:30:46,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153053239] [2019-11-23 21:30:46,868 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 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 21:30:46,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:30:46,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:46,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-23 21:30:46,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:46,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:46,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:46,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:46,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:46,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:46,983 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:46,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:30:46,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,051 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.9 percent of original size [2019-11-23 21:30:47,053 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|], 4=[|v_#memory_int_21|]} [2019-11-23 21:30:47,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:47,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:47,093 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:47,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:30:47,154 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,181 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:81, output treesize:56 [2019-11-23 21:30:47,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:30:47,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,380 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.offset_25|], 10=[|v_#memory_int_22|]} [2019-11-23 21:30:47,388 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 53 treesize of output 29 [2019-11-23 21:30:47,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,433 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 45 treesize of output 36 [2019-11-23 21:30:47,433 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:30:47,476 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:30:47,517 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:47,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2019-11-23 21:30:47,562 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,592 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:141, output treesize:110 [2019-11-23 21:30:47,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 87 [2019-11-23 21:30:47,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:47,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:47,840 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:47,878 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.2 percent of original size [2019-11-23 21:30:47,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 32 [2019-11-23 21:30:47,884 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:47,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:47,898 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:140, output treesize:30 [2019-11-23 21:30:47,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-23 21:30:47,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:47,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:47,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-23 21:30:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:48,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:48,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2019-11-23 21:30:48,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48809332] [2019-11-23 21:30:48,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 21:30:48,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:48,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 21:30:48,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:30:48,034 INFO L87 Difference]: Start difference. First operand 166 states and 221 transitions. Second operand 25 states. [2019-11-23 21:30:50,115 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-23 21:30:51,727 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-11-23 21:30:51,926 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-23 21:30:52,421 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2019-11-23 21:30:52,606 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-11-23 21:30:52,871 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2019-11-23 21:30:53,078 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-11-23 21:30:53,313 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-11-23 21:30:53,484 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-11-23 21:30:53,666 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-11-23 21:30:54,778 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 93 [2019-11-23 21:30:54,942 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-23 21:30:55,215 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 96 [2019-11-23 21:30:55,395 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-11-23 21:30:55,596 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-11-23 21:30:56,430 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 95 [2019-11-23 21:30:56,699 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-11-23 21:30:57,350 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 96 [2019-11-23 21:30:57,523 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-11-23 21:30:57,791 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 99 [2019-11-23 21:30:57,992 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-11-23 21:30:58,192 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-11-23 21:30:58,508 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-11-23 21:30:59,073 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-11-23 21:30:59,229 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-11-23 21:30:59,458 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-23 21:30:59,632 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-11-23 21:30:59,800 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-11-23 21:31:00,294 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-11-23 21:31:00,455 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-11-23 21:31:00,710 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 82 [2019-11-23 21:31:00,889 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-11-23 21:31:01,077 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-11-23 21:31:01,309 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-11-23 21:31:01,526 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 80 [2019-11-23 21:31:01,682 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-11-23 21:31:01,928 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-11-23 21:31:02,120 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-11-23 21:31:02,303 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-11-23 21:31:02,593 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-23 21:31:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:03,097 INFO L93 Difference]: Finished difference Result 661 states and 735 transitions. [2019-11-23 21:31:03,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-11-23 21:31:03,102 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-11-23 21:31:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:03,105 INFO L225 Difference]: With dead ends: 661 [2019-11-23 21:31:03,105 INFO L226 Difference]: Without dead ends: 659 [2019-11-23 21:31:03,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3073 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1605, Invalid=9951, Unknown=0, NotChecked=0, Total=11556 [2019-11-23 21:31:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-23 21:31:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 167. [2019-11-23 21:31:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-23 21:31:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 223 transitions. [2019-11-23 21:31:03,131 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 223 transitions. Word has length 35 [2019-11-23 21:31:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:03,132 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 223 transitions. [2019-11-23 21:31:03,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 21:31:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 223 transitions. [2019-11-23 21:31:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:31:03,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:03,133 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:03,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:03,337 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:03,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:03,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1673115221, now seen corresponding path program 3 times [2019-11-23 21:31:03,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:03,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938728788] [2019-11-23 21:31:03,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 21:31:03,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938728788] [2019-11-23 21:31:03,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009667647] [2019-11-23 21:31:03,400 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 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 21:31:03,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 21:31:03,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:03,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:31:03,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:03,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-23 21:31:03,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:03,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:03,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:03,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-23 21:31:03,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-23 21:31:03,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:03,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:03,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:03,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-11-23 21:31:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 21:31:03,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:03,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-23 21:31:03,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173090110] [2019-11-23 21:31:03,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:31:03,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:03,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:31:03,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:31:03,530 INFO L87 Difference]: Start difference. First operand 167 states and 223 transitions. Second operand 9 states. [2019-11-23 21:31:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:03,757 INFO L93 Difference]: Finished difference Result 359 states and 465 transitions. [2019-11-23 21:31:03,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 21:31:03,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-23 21:31:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:03,759 INFO L225 Difference]: With dead ends: 359 [2019-11-23 21:31:03,760 INFO L226 Difference]: Without dead ends: 244 [2019-11-23 21:31:03,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:31:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-23 21:31:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 173. [2019-11-23 21:31:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-23 21:31:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2019-11-23 21:31:03,781 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 35 [2019-11-23 21:31:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:03,781 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2019-11-23 21:31:03,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:31:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2019-11-23 21:31:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:31:03,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:03,782 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:03,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:03,982 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2033777433, now seen corresponding path program 4 times [2019-11-23 21:31:03,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:03,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550373800] [2019-11-23 21:31:03,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:04,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550373800] [2019-11-23 21:31:04,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474067201] [2019-11-23 21:31:04,332 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 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 21:31:04,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:31:04,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:04,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-23 21:31:04,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:04,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:31:04,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:31:04,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:31:04,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,505 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-11-23 21:31:04,508 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|], 4=[|v_#memory_int_23|]} [2019-11-23 21:31:04,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:04,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:04,538 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:04,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:31:04,560 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,576 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-11-23 21:31:04,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:31:04,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,709 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_29|], 4=[|v_#memory_int_24|]} [2019-11-23 21:31:04,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:31:04,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,769 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:04,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:31:04,812 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:04,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-23 21:31:04,853 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,911 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.6 percent of original size [2019-11-23 21:31:04,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:04,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-11-23 21:31:04,916 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:04,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:04,942 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:135, output treesize:71 [2019-11-23 21:31:05,236 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-23 21:31:05,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 53 [2019-11-23 21:31:05,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:05,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:05,238 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:05,269 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.1 percent of original size [2019-11-23 21:31:05,276 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:05,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-23 21:31:05,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:05,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:05,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:05,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:24 [2019-11-23 21:31:05,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:05,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:31:05,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:05,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:05,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:05,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:05,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-11-23 21:31:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:05,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:05,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2019-11-23 21:31:05,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044982730] [2019-11-23 21:31:05,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 21:31:05,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:05,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 21:31:05,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:31:05,358 INFO L87 Difference]: Start difference. First operand 173 states and 229 transitions. Second operand 22 states. [2019-11-23 21:31:06,300 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-11-23 21:31:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:07,136 INFO L93 Difference]: Finished difference Result 304 states and 363 transitions. [2019-11-23 21:31:07,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:31:07,137 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2019-11-23 21:31:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:07,139 INFO L225 Difference]: With dead ends: 304 [2019-11-23 21:31:07,139 INFO L226 Difference]: Without dead ends: 302 [2019-11-23 21:31:07,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 21:31:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-23 21:31:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 163. [2019-11-23 21:31:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-23 21:31:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2019-11-23 21:31:07,162 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 35 [2019-11-23 21:31:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:07,162 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2019-11-23 21:31:07,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 21:31:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2019-11-23 21:31:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:31:07,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:07,163 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:07,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:07,366 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1793076699, now seen corresponding path program 1 times [2019-11-23 21:31:07,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:07,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505293814] [2019-11-23 21:31:07,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:07,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505293814] [2019-11-23 21:31:07,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026287910] [2019-11-23 21:31:07,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:31:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:07,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-23 21:31:07,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:07,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:31:07,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:07,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:07,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:07,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:31:07,815 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:07,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:31:07,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:07,872 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-11-23 21:31:07,874 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 4=[|v_#memory_int_25|]} [2019-11-23 21:31:07,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:07,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:07,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:07,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:07,909 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:07,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:07,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:07,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:31:07,931 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:07,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:07,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:07,946 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:41 [2019-11-23 21:31:08,002 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:31:08,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:08,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,050 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|, |v_#memory_$Pointer$.base_32|], 4=[|v_#memory_int_26|]} [2019-11-23 21:31:08,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:31:08,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:08,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,099 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:08,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:31:08,131 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:08,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:08,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-23 21:31:08,160 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:08,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:08,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-11-23 21:31:08,190 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:08,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:08,210 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:126, output treesize:79 [2019-11-23 21:31:08,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 64 [2019-11-23 21:31:08,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:08,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:08,349 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:08,374 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size [2019-11-23 21:31:08,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-23 21:31:08,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:08,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:08,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:11 [2019-11-23 21:31:08,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:31:08,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:08,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:08,404 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 21:31:08,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:31:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:08,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:08,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2019-11-23 21:31:08,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797521731] [2019-11-23 21:31:08,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 21:31:08,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 21:31:08,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:31:08,413 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand 19 states. [2019-11-23 21:31:09,568 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2019-11-23 21:31:09,968 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-11-23 21:31:10,354 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-11-23 21:31:10,700 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-11-23 21:31:10,978 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-11-23 21:31:11,247 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-11-23 21:31:11,624 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-11-23 21:31:11,774 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-11-23 21:31:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:11,825 INFO L93 Difference]: Finished difference Result 242 states and 292 transitions. [2019-11-23 21:31:11,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 21:31:11,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-11-23 21:31:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:11,827 INFO L225 Difference]: With dead ends: 242 [2019-11-23 21:31:11,827 INFO L226 Difference]: Without dead ends: 240 [2019-11-23 21:31:11,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=469, Invalid=1693, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 21:31:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-23 21:31:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 143. [2019-11-23 21:31:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-23 21:31:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2019-11-23 21:31:11,847 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 35 [2019-11-23 21:31:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:11,847 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2019-11-23 21:31:11,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 21:31:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2019-11-23 21:31:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:31:11,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:11,848 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:12,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:12,052 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:12,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1235648681, now seen corresponding path program 5 times [2019-11-23 21:31:12,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:12,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795176542] [2019-11-23 21:31:12,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 21:31:12,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795176542] [2019-11-23 21:31:12,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873808869] [2019-11-23 21:31:12,125 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 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 21:31:12,183 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-23 21:31:12,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:12,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 21:31:12,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:12,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-23 21:31:12,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:12,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:12,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:12,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-23 21:31:12,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-23 21:31:12,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:12,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:12,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:12,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-11-23 21:31:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 21:31:12,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:12,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-23 21:31:12,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046411848] [2019-11-23 21:31:12,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:31:12,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:31:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:31:12,222 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand 10 states. [2019-11-23 21:31:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:12,523 INFO L93 Difference]: Finished difference Result 267 states and 330 transitions. [2019-11-23 21:31:12,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:31:12,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-11-23 21:31:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:12,526 INFO L225 Difference]: With dead ends: 267 [2019-11-23 21:31:12,526 INFO L226 Difference]: Without dead ends: 186 [2019-11-23 21:31:12,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:31:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-23 21:31:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 120. [2019-11-23 21:31:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-23 21:31:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2019-11-23 21:31:12,546 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 35 [2019-11-23 21:31:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:12,546 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2019-11-23 21:31:12,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:31:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2019-11-23 21:31:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:31:12,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:12,547 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:12,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:12,759 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:12,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:12,759 INFO L82 PathProgramCache]: Analyzing trace with hash -874986469, now seen corresponding path program 6 times [2019-11-23 21:31:12,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:12,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216926667] [2019-11-23 21:31:12,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:13,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216926667] [2019-11-23 21:31:13,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236582292] [2019-11-23 21:31:13,155 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 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 21:31:13,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-23 21:31:13,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:13,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-23 21:31:13,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:13,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:31:13,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:31:13,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:31:13,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,323 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-11-23 21:31:13,324 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|], 4=[|v_#memory_int_27|]} [2019-11-23 21:31:13,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:13,328 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:13,362 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:13,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:31:13,387 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,409 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-11-23 21:31:13,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:31:13,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,533 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.offset_34|], 4=[|v_#memory_int_28|]} [2019-11-23 21:31:13,541 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 47 treesize of output 23 [2019-11-23 21:31:13,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,589 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 39 treesize of output 30 [2019-11-23 21:31:13,589 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:31:13,643 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:31:13,680 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:13,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-11-23 21:31:13,715 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:13,736 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:132, output treesize:76 [2019-11-23 21:31:13,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:13,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 83 [2019-11-23 21:31:13,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:13,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:13,997 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:14,040 INFO L567 ElimStorePlain]: treesize reduction 28, result has 68.9 percent of original size [2019-11-23 21:31:14,048 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:14,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-23 21:31:14,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:14,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:14,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:14,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:32 [2019-11-23 21:31:14,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2019-11-23 21:31:14,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:14,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:14,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:14,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-11-23 21:31:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:14,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:14,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 24 [2019-11-23 21:31:14,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328896606] [2019-11-23 21:31:14,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 21:31:14,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 21:31:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:31:14,117 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 24 states. [2019-11-23 21:31:15,434 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2019-11-23 21:31:15,701 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 77 [2019-11-23 21:31:15,889 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-11-23 21:31:16,045 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2019-11-23 21:31:16,209 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-11-23 21:31:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:16,272 INFO L93 Difference]: Finished difference Result 221 states and 255 transitions. [2019-11-23 21:31:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 21:31:16,276 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-11-23 21:31:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:16,278 INFO L225 Difference]: With dead ends: 221 [2019-11-23 21:31:16,278 INFO L226 Difference]: Without dead ends: 219 [2019-11-23 21:31:16,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=266, Invalid=1294, Unknown=0, NotChecked=0, Total=1560 [2019-11-23 21:31:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-23 21:31:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 92. [2019-11-23 21:31:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-23 21:31:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2019-11-23 21:31:16,292 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 35 [2019-11-23 21:31:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:16,292 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2019-11-23 21:31:16,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 21:31:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2019-11-23 21:31:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 21:31:16,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:16,293 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:16,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:16,493 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:16,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1475182485, now seen corresponding path program 4 times [2019-11-23 21:31:16,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:16,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929991995] [2019-11-23 21:31:16,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:16,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929991995] [2019-11-23 21:31:16,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094490214] [2019-11-23 21:31:16,746 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 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 21:31:16,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:31:16,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:16,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 67 conjunts are in the unsatisfiable core [2019-11-23 21:31:16,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:16,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:31:16,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:16,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:16,825 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 11 treesize of output 7 [2019-11-23 21:31:16,826 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:16,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:16,838 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 11 treesize of output 7 [2019-11-23 21:31:16,838 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:16,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:16,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:16,847 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-11-23 21:31:16,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:16,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:31:16,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:16,942 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.8 percent of original size [2019-11-23 21:31:16,946 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:16,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:16,976 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:16,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:17,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-23 21:31:17,003 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:17,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:17,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-23 21:31:17,031 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:17,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:17,055 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:94, output treesize:55 [2019-11-23 21:31:17,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:31:17,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:17,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,159 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|], 5=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|]} [2019-11-23 21:31:17,162 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:17,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,196 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:17,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:17,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 76 [2019-11-23 21:31:17,243 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:17,324 INFO L567 ElimStorePlain]: treesize reduction 48, result has 62.8 percent of original size [2019-11-23 21:31:17,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:17,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:17,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2019-11-23 21:31:17,330 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:17,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:17,351 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:120, output treesize:80 [2019-11-23 21:31:17,727 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-23 21:31:17,728 INFO L343 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-11-23 21:31:17,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 143 [2019-11-23 21:31:17,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:17,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:17,834 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:17,892 INFO L567 ElimStorePlain]: treesize reduction 97, result has 34.9 percent of original size [2019-11-23 21:31:17,905 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2019-11-23 21:31:17,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:17,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:17,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:17,917 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:7 [2019-11-23 21:31:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:17,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:17,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2019-11-23 21:31:17,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213294006] [2019-11-23 21:31:17,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:31:17,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:31:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:31:17,948 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 18 states. [2019-11-23 21:31:18,614 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-11-23 21:31:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:19,167 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2019-11-23 21:31:19,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:31:19,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-23 21:31:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:19,168 INFO L225 Difference]: With dead ends: 137 [2019-11-23 21:31:19,168 INFO L226 Difference]: Without dead ends: 111 [2019-11-23 21:31:19,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:31:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-23 21:31:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-23 21:31:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-23 21:31:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 134 transitions. [2019-11-23 21:31:19,194 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 134 transitions. Word has length 38 [2019-11-23 21:31:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:19,195 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 134 transitions. [2019-11-23 21:31:19,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:31:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2019-11-23 21:31:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 21:31:19,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:19,195 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:19,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:19,407 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash 343379832, now seen corresponding path program 7 times [2019-11-23 21:31:19,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:19,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885307742] [2019-11-23 21:31:19,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:31:19,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885307742] [2019-11-23 21:31:19,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900481150] [2019-11-23 21:31:19,838 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 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 21:31:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:19,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-23 21:31:19,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:19,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:31:19,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:19,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:19,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:19,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:31:19,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:19,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:31:19,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,012 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.3 percent of original size [2019-11-23 21:31:20,013 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 4=[|v_#memory_int_29|]} [2019-11-23 21:31:20,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:20,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:20,048 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:20,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:31:20,080 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,101 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:72, output treesize:47 [2019-11-23 21:31:20,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:31:20,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,307 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|, |v_#memory_$Pointer$.base_43|], 10=[|v_#memory_int_30|]} [2019-11-23 21:31:20,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:31:20,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,354 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:20,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:31:20,390 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:20,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2019-11-23 21:31:20,427 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:20,471 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2019-11-23 21:31:20,472 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,495 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:143, output treesize:112 [2019-11-23 21:31:20,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 89 [2019-11-23 21:31:20,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:20,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:20,647 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:20,677 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.7 percent of original size [2019-11-23 21:31:20,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2019-11-23 21:31:20,681 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:20,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:20,694 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:142, output treesize:32 [2019-11-23 21:31:20,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2019-11-23 21:31:20,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:20,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:20,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-11-23 21:31:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:31:20,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:20,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 24 [2019-11-23 21:31:20,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695077603] [2019-11-23 21:31:20,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 21:31:20,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:20,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 21:31:20,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:31:20,748 INFO L87 Difference]: Start difference. First operand 111 states and 134 transitions. Second operand 24 states. [2019-11-23 21:31:22,256 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-11-23 21:31:22,429 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-11-23 21:31:22,845 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-11-23 21:31:23,274 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-11-23 21:31:23,580 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2019-11-23 21:31:23,852 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-11-23 21:31:24,150 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-11-23 21:31:24,291 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-11-23 21:31:24,466 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-11-23 21:31:24,610 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-11-23 21:31:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:24,697 INFO L93 Difference]: Finished difference Result 217 states and 248 transitions. [2019-11-23 21:31:24,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 21:31:24,697 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2019-11-23 21:31:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:24,699 INFO L225 Difference]: With dead ends: 217 [2019-11-23 21:31:24,700 INFO L226 Difference]: Without dead ends: 215 [2019-11-23 21:31:24,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=501, Invalid=2151, Unknown=0, NotChecked=0, Total=2652 [2019-11-23 21:31:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-23 21:31:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 73. [2019-11-23 21:31:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-23 21:31:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2019-11-23 21:31:24,713 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 40 [2019-11-23 21:31:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:24,714 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2019-11-23 21:31:24,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 21:31:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2019-11-23 21:31:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 21:31:24,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:24,715 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:24,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:24,918 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash -901782222, now seen corresponding path program 5 times [2019-11-23 21:31:24,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:24,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985461292] [2019-11-23 21:31:24,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:25,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985461292] [2019-11-23 21:31:25,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074486679] [2019-11-23 21:31:25,317 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:25,407 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-23 21:31:25,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:25,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 82 conjunts are in the unsatisfiable core [2019-11-23 21:31:25,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:25,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:31:25,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:25,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:25,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:25,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-11-23 21:31:25,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:25,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:31:25,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:25,527 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.7 percent of original size [2019-11-23 21:31:25,529 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_44|], 4=[|v_#memory_int_31|]} [2019-11-23 21:31:25,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:25,534 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:25,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:25,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:25,560 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:25,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:25,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:25,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-23 21:31:25,587 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:25,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:25,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:25,604 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:44 [2019-11-23 21:31:25,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:25,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-23 21:31:25,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:25,833 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-23 21:31:25,833 INFO L567 ElimStorePlain]: treesize reduction 40, result has 77.9 percent of original size [2019-11-23 21:31:25,836 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.offset_45|], 4=[|v_#memory_int_32|]} [2019-11-23 21:31:25,844 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:25,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:25,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:25,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2019-11-23 21:31:25,924 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:26,045 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-23 21:31:26,045 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.9 percent of original size [2019-11-23 21:31:26,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:31:26,057 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:26,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:31:26,104 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:26,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-11-23 21:31:26,141 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:26,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:26,168 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:135, output treesize:92 [2019-11-23 21:31:26,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-23 21:31:26,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:26,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,323 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_46|], 4=[|v_#memory_int_33|], 5=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_48|]} [2019-11-23 21:31:26,327 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:26,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,379 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:26,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-11-23 21:31:26,426 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:26,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 88 [2019-11-23 21:31:26,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,484 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:26,562 INFO L567 ElimStorePlain]: treesize reduction 56, result has 63.4 percent of original size [2019-11-23 21:31:26,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:26,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2019-11-23 21:31:26,571 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:26,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:26,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:26,605 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:177, output treesize:116 [2019-11-23 21:31:26,918 INFO L343 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-11-23 21:31:26,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 168 treesize of output 151 [2019-11-23 21:31:26,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:26,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:26,947 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:27,053 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-23 21:31:27,054 INFO L567 ElimStorePlain]: treesize reduction 89, result has 44.4 percent of original size [2019-11-23 21:31:27,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:27,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2019-11-23 21:31:27,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:27,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:27,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:27,085 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:11 [2019-11-23 21:31:27,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:31:27,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:27,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:27,114 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 21:31:27,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:31:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:27,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:27,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2019-11-23 21:31:27,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589059436] [2019-11-23 21:31:27,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 21:31:27,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:27,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 21:31:27,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:31:27,131 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 24 states. [2019-11-23 21:31:27,962 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-11-23 21:31:28,127 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2019-11-23 21:31:28,499 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 101 [2019-11-23 21:31:28,812 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-11-23 21:31:29,075 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 101 [2019-11-23 21:31:29,306 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 103 [2019-11-23 21:31:29,568 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 98 [2019-11-23 21:31:29,788 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 100 [2019-11-23 21:31:30,016 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2019-11-23 21:31:30,215 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-11-23 21:31:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:30,258 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-11-23 21:31:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 21:31:30,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-11-23 21:31:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:30,259 INFO L225 Difference]: With dead ends: 83 [2019-11-23 21:31:30,260 INFO L226 Difference]: Without dead ends: 81 [2019-11-23 21:31:30,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=302, Invalid=1104, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 21:31:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-23 21:31:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2019-11-23 21:31:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-23 21:31:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2019-11-23 21:31:30,271 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 43 [2019-11-23 21:31:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:30,271 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2019-11-23 21:31:30,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 21:31:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2019-11-23 21:31:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 21:31:30,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:30,272 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:30,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:30,472 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 970804020, now seen corresponding path program 3 times [2019-11-23 21:31:30,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:30,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881591279] [2019-11-23 21:31:30,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:30,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881591279] [2019-11-23 21:31:30,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362881253] [2019-11-23 21:31:30,870 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:30,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 21:31:30,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:30,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 77 conjunts are in the unsatisfiable core [2019-11-23 21:31:30,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:30,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:31:30,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:30,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:30,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:30,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:31:31,034 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:31:31,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,091 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-11-23 21:31:31,093 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_49|], 4=[|v_#memory_int_34|]} [2019-11-23 21:31:31,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:31,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:31,130 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:31,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-11-23 21:31:31,155 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,172 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:71, output treesize:43 [2019-11-23 21:31:31,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-23 21:31:31,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,401 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-23 21:31:31,402 INFO L567 ElimStorePlain]: treesize reduction 40, result has 77.8 percent of original size [2019-11-23 21:31:31,405 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.base_52|, |v_#memory_$Pointer$.offset_50|, |v_#memory_$Pointer$.offset_52|], 4=[|v_#memory_int_35|]} [2019-11-23 21:31:31,408 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:31,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:31,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2019-11-23 21:31:31,464 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,551 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.8 percent of original size [2019-11-23 21:31:31,554 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:31,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:31,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:31,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2019-11-23 21:31:31,600 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:31,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2019-11-23 21:31:31,638 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,666 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:134, output treesize:91 [2019-11-23 21:31:31,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:31,757 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-23 21:31:31,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,820 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_51|], 4=[|v_#memory_int_36|], 5=[|v_#memory_$Pointer$.base_53|, |v_#memory_$Pointer$.offset_53|]} [2019-11-23 21:31:31,822 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:31,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,879 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:31,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:31,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2019-11-23 21:31:31,940 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:31,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:31,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:31,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 87 [2019-11-23 21:31:31,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:31,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,001 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:32,077 INFO L567 ElimStorePlain]: treesize reduction 56, result has 63.2 percent of original size [2019-11-23 21:31:32,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:32,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:32,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:32,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:32,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2019-11-23 21:31:32,109 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:32,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:32,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:32,143 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:176, output treesize:115 [2019-11-23 21:31:32,517 INFO L343 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-11-23 21:31:32,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 167 treesize of output 150 [2019-11-23 21:31:32,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:32,573 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:32,647 INFO L567 ElimStorePlain]: treesize reduction 89, result has 44.0 percent of original size [2019-11-23 21:31:32,661 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:32,661 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 41 [2019-11-23 21:31:32,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:32,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:32,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:32,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:174, output treesize:9 [2019-11-23 21:31:32,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-23 21:31:32,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:32,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:32,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:32,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-23 21:31:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:32,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:32,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 26 [2019-11-23 21:31:32,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900664689] [2019-11-23 21:31:32,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 21:31:32,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:32,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 21:31:32,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-11-23 21:31:32,702 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 26 states. [2019-11-23 21:31:34,250 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-11-23 21:31:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:37,243 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2019-11-23 21:31:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-23 21:31:37,244 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2019-11-23 21:31:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:37,246 INFO L225 Difference]: With dead ends: 244 [2019-11-23 21:31:37,246 INFO L226 Difference]: Without dead ends: 242 [2019-11-23 21:31:37,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=306, Invalid=2244, Unknown=0, NotChecked=0, Total=2550 [2019-11-23 21:31:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-23 21:31:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 151. [2019-11-23 21:31:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-23 21:31:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 182 transitions. [2019-11-23 21:31:37,273 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 182 transitions. Word has length 45 [2019-11-23 21:31:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:37,273 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 182 transitions. [2019-11-23 21:31:37,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 21:31:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 182 transitions. [2019-11-23 21:31:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 21:31:37,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:37,274 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:37,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:37,475 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1538950708, now seen corresponding path program 3 times [2019-11-23 21:31:37,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:37,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304236437] [2019-11-23 21:31:37,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:38,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304236437] [2019-11-23 21:31:38,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179139072] [2019-11-23 21:31:38,611 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:38,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 21:31:38,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:38,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-23 21:31:38,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:38,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:31:38,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:38,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:38,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:38,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:31:38,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:38,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:31:38,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:38,861 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-11-23 21:31:38,862 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_54|, |v_#memory_$Pointer$.base_54|], 4=[|v_#memory_int_37|]} [2019-11-23 21:31:38,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:38,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:38,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:38,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:38,894 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:38,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:38,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:38,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-11-23 21:31:38,918 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:38,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:38,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:38,937 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:71, output treesize:43 [2019-11-23 21:31:39,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-23 21:31:39,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,192 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-23 21:31:39,192 INFO L567 ElimStorePlain]: treesize reduction 40, result has 77.8 percent of original size [2019-11-23 21:31:39,193 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_55|, |v_#memory_$Pointer$.offset_57|, |v_#memory_$Pointer$.base_55|], 4=[|v_#memory_int_38|]} [2019-11-23 21:31:39,201 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 62 treesize of output 34 [2019-11-23 21:31:39,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,245 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:39,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:39,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2019-11-23 21:31:39,287 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,329 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 54 treesize of output 41 [2019-11-23 21:31:39,330 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,395 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.1 percent of original size [2019-11-23 21:31:39,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:39,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2019-11-23 21:31:39,401 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,428 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:134, output treesize:91 [2019-11-23 21:31:39,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:39,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-23 21:31:39,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,589 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_56|], 4=[|v_#memory_int_39|], 5=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_58|]} [2019-11-23 21:31:39,594 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:39,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,659 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:39,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:39,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2019-11-23 21:31:39,723 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:39,790 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 87 [2019-11-23 21:31:39,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:39,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:39,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:39,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:39,793 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:39,929 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-11-23 21:31:39,929 INFO L567 ElimStorePlain]: treesize reduction 56, result has 66.5 percent of original size [2019-11-23 21:31:39,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:39,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:39,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:39,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:39,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2019-11-23 21:31:39,940 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:39,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:39,982 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:191, output treesize:130 [2019-11-23 21:31:40,561 INFO L343 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-11-23 21:31:40,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 171 treesize of output 154 [2019-11-23 21:31:40,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:40,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:40,616 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:40,698 INFO L567 ElimStorePlain]: treesize reduction 89, result has 47.6 percent of original size [2019-11-23 21:31:40,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:40,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 45 [2019-11-23 21:31:40,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:40,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:40,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:40,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:185, output treesize:25 [2019-11-23 21:31:40,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-23 21:31:40,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:40,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:40,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:40,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-23 21:31:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:40,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:40,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 34 [2019-11-23 21:31:40,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441234130] [2019-11-23 21:31:40,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-23 21:31:40,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-23 21:31:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 21:31:40,846 INFO L87 Difference]: Start difference. First operand 151 states and 182 transitions. Second operand 34 states.