/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/forester-heap/sll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:29:38,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:29:38,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:29:38,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:29:38,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:29:38,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:29:38,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:29:38,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:29:38,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:29:38,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:29:38,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:29:38,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:29:38,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:29:38,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:29:38,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:29:38,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:29:38,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:29:38,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:29:38,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:29:38,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:29:38,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:29:38,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:29:38,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:29:38,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:29:38,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:29:38,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:29:38,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:29:38,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:29:38,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:29:38,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:29:38,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:29:38,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:29:38,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:29:38,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:29:38,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:29:38,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:29:38,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:29:38,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:29:38,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:29:38,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:29:38,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:29:38,499 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:29:38,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:29:38,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:29:38,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:29:38,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:29:38,529 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:29:38,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:29:38,529 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:29:38,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:29:38,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:29:38,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:29:38,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:29:38,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:29:38,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:29:38,532 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:29:38,533 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:29:38,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:29:38,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:29:38,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:29:38,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:29:38,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:29:38,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:29:38,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:29:38,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:29:38,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:29:38,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:29:38,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:29:38,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:29:38,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:29:38,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:29:38,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:29:38,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:29:38,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:29:38,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:29:38,816 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:29:38,817 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:29:38,817 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-11-23 21:29:38,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5970f336f/be46500a31ca447a9ca1c7d0d02cc7eb/FLAGa68f2db3f [2019-11-23 21:29:39,421 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:29:39,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-11-23 21:29:39,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5970f336f/be46500a31ca447a9ca1c7d0d02cc7eb/FLAGa68f2db3f [2019-11-23 21:29:39,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5970f336f/be46500a31ca447a9ca1c7d0d02cc7eb [2019-11-23 21:29:39,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:29:39,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:29:39,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:29:39,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:29:39,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:29:39,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:39" (1/1) ... [2019-11-23 21:29:39,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79daf568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:39, skipping insertion in model container [2019-11-23 21:29:39,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:39" (1/1) ... [2019-11-23 21:29:39,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:29:39,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:29:40,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:29:40,201 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:29:40,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:29:40,298 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:29:40,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40 WrapperNode [2019-11-23 21:29:40,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:29:40,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:29:40,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:29:40,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:29:40,308 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:29:40" (1/1) ... [2019-11-23 21:29:40,330 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:29:40" (1/1) ... [2019-11-23 21:29:40,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:29:40,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:29:40,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:29:40,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:29:40,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2019-11-23 21:29:40,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2019-11-23 21:29:40,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2019-11-23 21:29:40,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2019-11-23 21:29:40,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2019-11-23 21:29:40,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2019-11-23 21:29:40,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2019-11-23 21:29:40,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:29:40,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:29:40,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:29:40,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:29:40,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (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:29:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:29:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:29:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:29:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:29:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:29:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:29:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:29:40,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:29:40,859 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:29:40,859 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-11-23 21:29:40,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:40 BoogieIcfgContainer [2019-11-23 21:29:40,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:29:40,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:29:40,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:29:40,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:29:40,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:29:39" (1/3) ... [2019-11-23 21:29:40,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6fa06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:29:40, skipping insertion in model container [2019-11-23 21:29:40,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (2/3) ... [2019-11-23 21:29:40,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6fa06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:29:40, skipping insertion in model container [2019-11-23 21:29:40,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:40" (3/3) ... [2019-11-23 21:29:40,869 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2019-11-23 21:29:40,879 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:29:40,886 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-23 21:29:40,898 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-23 21:29:40,922 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:29:40,923 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:29:40,923 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:29:40,923 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:29:40,923 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:29:40,923 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:29:40,923 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:29:40,924 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:29:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-23 21:29:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-23 21:29:40,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:40,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-23 21:29:40,946 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash 890337990, now seen corresponding path program 1 times [2019-11-23 21:29:40,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:40,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662432439] [2019-11-23 21:29:40,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:41,090 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:29:41,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662432439] [2019-11-23 21:29:41,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:41,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:29:41,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079187993] [2019-11-23 21:29:41,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:29:41,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:41,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:29:41,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:29:41,116 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-11-23 21:29:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:41,140 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2019-11-23 21:29:41,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:29:41,142 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-23 21:29:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:41,152 INFO L225 Difference]: With dead ends: 86 [2019-11-23 21:29:41,152 INFO L226 Difference]: Without dead ends: 39 [2019-11-23 21:29:41,155 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:29:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-23 21:29:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-23 21:29:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 21:29:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-23 21:29:41,194 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 6 [2019-11-23 21:29:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:41,194 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-23 21:29:41,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:29:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-23 21:29:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-23 21:29:41,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:41,196 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-23 21:29:41,196 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash 889571369, now seen corresponding path program 1 times [2019-11-23 21:29:41,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:41,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705418584] [2019-11-23 21:29:41,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:41,277 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:29:41,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705418584] [2019-11-23 21:29:41,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:41,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:29:41,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458769514] [2019-11-23 21:29:41,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:29:41,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:29:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:29:41,281 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 3 states. [2019-11-23 21:29:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:41,348 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-23 21:29:41,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:29:41,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-23 21:29:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:41,350 INFO L225 Difference]: With dead ends: 39 [2019-11-23 21:29:41,350 INFO L226 Difference]: Without dead ends: 37 [2019-11-23 21:29:41,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:29:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-23 21:29:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-23 21:29:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-23 21:29:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-11-23 21:29:41,357 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2019-11-23 21:29:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:41,357 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-11-23 21:29:41,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:29:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-11-23 21:29:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-23 21:29:41,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:41,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:41,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:41,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:41,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1806865149, now seen corresponding path program 1 times [2019-11-23 21:29:41,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:41,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742829228] [2019-11-23 21:29:41,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:41,437 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:29:41,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742829228] [2019-11-23 21:29:41,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:41,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:29:41,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555135929] [2019-11-23 21:29:41,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:29:41,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:41,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:29:41,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:29:41,439 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2019-11-23 21:29:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:41,533 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-11-23 21:29:41,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:29:41,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-23 21:29:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:41,535 INFO L225 Difference]: With dead ends: 63 [2019-11-23 21:29:41,535 INFO L226 Difference]: Without dead ends: 61 [2019-11-23 21:29:41,536 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:29:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-23 21:29:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2019-11-23 21:29:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-23 21:29:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-11-23 21:29:41,543 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2019-11-23 21:29:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:41,544 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-11-23 21:29:41,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:29:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-11-23 21:29:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 21:29:41,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:41,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:41,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:41,546 INFO L82 PathProgramCache]: Analyzing trace with hash -913382283, now seen corresponding path program 1 times [2019-11-23 21:29:41,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:41,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476528542] [2019-11-23 21:29:41,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:41,619 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:29:41,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476528542] [2019-11-23 21:29:41,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:41,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:29:41,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977065295] [2019-11-23 21:29:41,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:29:41,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:41,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:29:41,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:29:41,622 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2019-11-23 21:29:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:41,725 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-11-23 21:29:41,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:29:41,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-23 21:29:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:41,727 INFO L225 Difference]: With dead ends: 35 [2019-11-23 21:29:41,728 INFO L226 Difference]: Without dead ends: 33 [2019-11-23 21:29:41,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:29:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-23 21:29:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-23 21:29:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 21:29:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-23 21:29:41,750 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2019-11-23 21:29:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:41,750 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-23 21:29:41,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:29:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-23 21:29:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 21:29:41,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:41,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:41,754 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:41,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:41,755 INFO L82 PathProgramCache]: Analyzing trace with hash -913344547, now seen corresponding path program 1 times [2019-11-23 21:29:41,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:41,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571454993] [2019-11-23 21:29:41,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:41,977 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:29:41,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571454993] [2019-11-23 21:29:41,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:41,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:29:41,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635383056] [2019-11-23 21:29:41,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:29:41,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:41,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:29:41,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:29:41,980 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2019-11-23 21:29:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:42,142 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-11-23 21:29:42,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:29:42,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-23 21:29:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:42,144 INFO L225 Difference]: With dead ends: 68 [2019-11-23 21:29:42,144 INFO L226 Difference]: Without dead ends: 44 [2019-11-23 21:29:42,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:29:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-23 21:29:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-11-23 21:29:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-23 21:29:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-11-23 21:29:42,161 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2019-11-23 21:29:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:42,163 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-11-23 21:29:42,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:29:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-11-23 21:29:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:29:42,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:42,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:42,165 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash -313255267, now seen corresponding path program 1 times [2019-11-23 21:29:42,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:42,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607541955] [2019-11-23 21:29:42,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:42,352 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:29:42,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607541955] [2019-11-23 21:29:42,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:42,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:29:42,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987920271] [2019-11-23 21:29:42,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:29:42,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:29:42,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:29:42,355 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-11-23 21:29:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:42,497 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-23 21:29:42,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:29:42,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-23 21:29:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:42,500 INFO L225 Difference]: With dead ends: 50 [2019-11-23 21:29:42,500 INFO L226 Difference]: Without dead ends: 48 [2019-11-23 21:29:42,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:29:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-23 21:29:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-11-23 21:29:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 21:29:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-23 21:29:42,510 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 16 [2019-11-23 21:29:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:42,511 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-23 21:29:42,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:29:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-23 21:29:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:29:42,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:42,512 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:42,513 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash -648614522, now seen corresponding path program 1 times [2019-11-23 21:29:42,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:42,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208690990] [2019-11-23 21:29:42,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:42,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208690990] [2019-11-23 21:29:42,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993445480] [2019-11-23 21:29:42,636 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:29:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:42,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 21:29:42,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:42,766 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:29:42,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 21:29:42,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-23 21:29:42,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,862 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:29:42,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,918 INFO L567 ElimStorePlain]: treesize reduction 14, result has 79.7 percent of original size [2019-11-23 21:29:42,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:42,932 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 25 treesize of output 13 [2019-11-23 21:29:42,933 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,957 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 23 treesize of output 22 [2019-11-23 21:29:42,959 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,974 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:29:42,975 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:36 [2019-11-23 21:29:43,045 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:43,046 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 16 treesize of output 26 [2019-11-23 21:29:43,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:43,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:43,078 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_22|], 10=[|v_#memory_int_24|]} [2019-11-23 21:29:43,087 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:29:43,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:43,142 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-23 21:29:43,143 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 2 case distinctions, treesize of input 56 treesize of output 39 [2019-11-23 21:29:43,144 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:43,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:43,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:43,170 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:72, output treesize:41 [2019-11-23 21:29:43,225 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-23 21:29:43,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:43,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:43,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:43,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-23 21:29:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:43,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:43,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-23 21:29:43,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877327546] [2019-11-23 21:29:43,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:29:43,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:29:43,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:29:43,244 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 9 states. [2019-11-23 21:29:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:43,519 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-11-23 21:29:43,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:29:43,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-11-23 21:29:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:43,521 INFO L225 Difference]: With dead ends: 58 [2019-11-23 21:29:43,521 INFO L226 Difference]: Without dead ends: 56 [2019-11-23 21:29:43,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:29:43,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-23 21:29:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-11-23 21:29:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 21:29:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-23 21:29:43,532 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-11-23 21:29:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:43,533 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-23 21:29:43,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:29:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-23 21:29:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:29:43,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:43,534 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:43,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:43,739 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:43,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1000772550, now seen corresponding path program 1 times [2019-11-23 21:29:43,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:43,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540344640] [2019-11-23 21:29:43,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:43,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540344640] [2019-11-23 21:29:43,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148949049] [2019-11-23 21:29:43,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:44,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 21:29:44,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:44,016 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:29:44,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 21:29:44,051 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-23 21:29:44,150 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,150 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:29:44,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,191 INFO L567 ElimStorePlain]: treesize reduction 14, result has 79.7 percent of original size [2019-11-23 21:29:44,200 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:29:44,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:44,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 39 treesize of output 29 [2019-11-23 21:29:44,229 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,242 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:29:44,243 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:36 [2019-11-23 21:29:44,287 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,287 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 16 treesize of output 26 [2019-11-23 21:29:44,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,313 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|], 10=[|v_#memory_int_29|]} [2019-11-23 21:29:44,317 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:29:44,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,353 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-23 21:29:44,355 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 2 case distinctions, treesize of input 56 treesize of output 39 [2019-11-23 21:29:44,356 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:44,379 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:72, output treesize:41 [2019-11-23 21:29:44,435 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-23 21:29:44,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-23 21:29:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:44,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:44,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-23 21:29:44,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465333417] [2019-11-23 21:29:44,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:29:44,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:29:44,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:29:44,463 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2019-11-23 21:29:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:44,753 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-23 21:29:44,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:29:44,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-23 21:29:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:44,755 INFO L225 Difference]: With dead ends: 68 [2019-11-23 21:29:44,755 INFO L226 Difference]: Without dead ends: 52 [2019-11-23 21:29:44,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:29:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-23 21:29:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-11-23 21:29:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 21:29:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-23 21:29:44,761 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2019-11-23 21:29:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:44,762 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-23 21:29:44,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:29:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-23 21:29:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:29:44,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:44,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:44,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:44,967 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:44,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1552465966, now seen corresponding path program 1 times [2019-11-23 21:29:44,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:44,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342753703] [2019-11-23 21:29:44,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:45,000 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:29:45,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342753703] [2019-11-23 21:29:45,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:45,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:29:45,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605030106] [2019-11-23 21:29:45,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:29:45,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:45,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:29:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:29:45,002 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2019-11-23 21:29:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:45,064 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-23 21:29:45,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:29:45,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-23 21:29:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:45,065 INFO L225 Difference]: With dead ends: 50 [2019-11-23 21:29:45,065 INFO L226 Difference]: Without dead ends: 31 [2019-11-23 21:29:45,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:29:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-23 21:29:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-23 21:29:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-23 21:29:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-11-23 21:29:45,070 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2019-11-23 21:29:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:45,070 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-11-23 21:29:45,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:29:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-11-23 21:29:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:29:45,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:45,071 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:45,072 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1970202869, now seen corresponding path program 1 times [2019-11-23 21:29:45,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:45,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872399712] [2019-11-23 21:29:45,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:45,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872399712] [2019-11-23 21:29:45,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208206396] [2019-11-23 21:29:45,312 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:29:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:45,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-23 21:29:45,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:45,388 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:29:45,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:45,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,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:29:45,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,507 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.3 percent of original size [2019-11-23 21:29:45,513 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 35 treesize of output 7 [2019-11-23 21:29:45,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,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 35 treesize of output 7 [2019-11-23 21:29:45,533 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,549 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:29:45,550 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:90, output treesize:32 [2019-11-23 21:29:45,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,616 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:29:45,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,699 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_18|, |v_#memory_int_30|], 4=[|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_16|]} [2019-11-23 21:29:45,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:45,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2019-11-23 21:29:45,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,843 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 183 [2019-11-23 21:29:45,845 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,924 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 135 [2019-11-23 21:29:45,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:45,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:45,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:45,934 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2019-11-23 21:29:46,061 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-23 21:29:46,062 INFO L567 ElimStorePlain]: treesize reduction 281, result has 35.4 percent of original size [2019-11-23 21:29:46,068 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 25 treesize of output 24 [2019-11-23 21:29:46,069 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:46,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:46,158 INFO L343 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2019-11-23 21:29:46,158 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 102 [2019-11-23 21:29:46,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:46,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:46,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:46,162 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-23 21:29:46,243 INFO L567 ElimStorePlain]: treesize reduction 96, result has 53.4 percent of original size [2019-11-23 21:29:46,249 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 59 treesize of output 22 [2019-11-23 21:29:46,250 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:46,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:46,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:46,267 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:288, output treesize:80 [2019-11-23 21:29:46,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:46,310 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 80 treesize of output 51 [2019-11-23 21:29:46,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:46,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:46,312 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:29:46,339 INFO L567 ElimStorePlain]: treesize reduction 12, result has 79.7 percent of original size [2019-11-23 21:29:46,342 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-23 21:29:46,343 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:29:46,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:46,354 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:29:46,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:24 [2019-11-23 21:29:46,383 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 24 treesize of output 10 [2019-11-23 21:29:46,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:46,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:46,391 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:29:46,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-23 21:29:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:46,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:46,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-23 21:29:46,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789120391] [2019-11-23 21:29:46,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:29:46,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:46,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:29:46,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:29:46,410 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 14 states. [2019-11-23 21:29:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:46,673 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-23 21:29:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:29:46,673 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-23 21:29:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:46,674 INFO L225 Difference]: With dead ends: 66 [2019-11-23 21:29:46,675 INFO L226 Difference]: Without dead ends: 50 [2019-11-23 21:29:46,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:29:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-23 21:29:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-11-23 21:29:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 21:29:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-11-23 21:29:46,682 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 22 [2019-11-23 21:29:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:46,682 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-11-23 21:29:46,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:29:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-11-23 21:29:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:29:46,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:46,683 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:46,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:46,887 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash -882557003, now seen corresponding path program 1 times [2019-11-23 21:29:46,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:46,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401259094] [2019-11-23 21:29:46,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:47,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401259094] [2019-11-23 21:29:47,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7995661] [2019-11-23 21:29:47,124 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:29:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:47,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 21:29:47,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:47,197 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:29:47,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:47,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,263 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:29:47,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,331 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.3 percent of original size [2019-11-23 21:29:47,338 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 35 treesize of output 7 [2019-11-23 21:29:47,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,361 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 35 treesize of output 7 [2019-11-23 21:29:47,362 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,380 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:29:47,380 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:90, output treesize:32 [2019-11-23 21:29:47,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,475 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:29:47,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,546 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|], 4=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_19|]} [2019-11-23 21:29:47,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 21:29:47,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,616 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 170 [2019-11-23 21:29:47,617 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,685 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 128 [2019-11-23 21:29:47,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:47,688 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,751 INFO L567 ElimStorePlain]: treesize reduction 28, result has 83.2 percent of original size [2019-11-23 21:29:47,759 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 59 treesize of output 22 [2019-11-23 21:29:47,760 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:47,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:47,839 INFO L343 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2019-11-23 21:29:47,839 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 67 [2019-11-23 21:29:47,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:47,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:47,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:47,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:47,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:47,843 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-23 21:29:47,882 INFO L567 ElimStorePlain]: treesize reduction 45, result has 56.7 percent of original size [2019-11-23 21:29:47,883 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:29:47,883 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:244, output treesize:69 [2019-11-23 21:29:48,000 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,000 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 92 treesize of output 74 [2019-11-23 21:29:48,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:48,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:48,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:48,011 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:29:48,040 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.1 percent of original size [2019-11-23 21:29:48,046 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,046 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 32 treesize of output 27 [2019-11-23 21:29:48,047 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,053 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:29:48,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:9 [2019-11-23 21:29:48,075 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:29:48,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,077 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:29:48,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-23 21:29:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:48,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:48,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-11-23 21:29:48,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496097228] [2019-11-23 21:29:48,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 21:29:48,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 21:29:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:29:48,084 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 16 states. [2019-11-23 21:29:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:48,470 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-23 21:29:48,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 21:29:48,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-23 21:29:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:48,471 INFO L225 Difference]: With dead ends: 54 [2019-11-23 21:29:48,471 INFO L226 Difference]: Without dead ends: 35 [2019-11-23 21:29:48,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:29:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-23 21:29:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-23 21:29:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-23 21:29:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-23 21:29:48,476 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 26 [2019-11-23 21:29:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:48,476 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-23 21:29:48,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 21:29:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-23 21:29:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:29:48,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:48,477 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:48,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:48,681 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1994252450, now seen corresponding path program 2 times [2019-11-23 21:29:48,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:48,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894141719] [2019-11-23 21:29:48,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:48,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894141719] [2019-11-23 21:29:48,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042777950] [2019-11-23 21:29:48,989 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 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:29:49,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:29:49,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:29:49,049 WARN L253 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-23 21:29:49,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:49,059 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:29:49,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:29:49,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,102 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:29:49,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,172 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.1 percent of original size [2019-11-23 21:29:49,178 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 35 treesize of output 7 [2019-11-23 21:29:49,179 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,212 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 13 treesize of output 9 [2019-11-23 21:29:49,212 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,237 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 35 treesize of output 7 [2019-11-23 21:29:49,237 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,259 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:44 [2019-11-23 21:29:49,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,316 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:29:49,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,499 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-23 21:29:49,501 INFO L567 ElimStorePlain]: treesize reduction 40, result has 83.7 percent of original size [2019-11-23 21:29:49,506 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_int_34|], 4=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|]} [2019-11-23 21:29:49,519 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 39 treesize of output 15 [2019-11-23 21:29:49,520 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,588 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 25 treesize of output 24 [2019-11-23 21:29:49,588 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:49,657 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,657 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 89 [2019-11-23 21:29:49,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:49,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:49,660 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,752 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.1 percent of original size [2019-11-23 21:29:49,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:49,759 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 59 treesize of output 22 [2019-11-23 21:29:49,759 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,787 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:200, output treesize:87 [2019-11-23 21:29:49,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:49,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,899 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:29:49,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:50,022 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-23 21:29:50,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:50,024 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_35|], 4=[|v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_22|], 5=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|], 10=[|v_#memory_int_37|]} [2019-11-23 21:29:50,028 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:29:50,133 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-23 21:29:50,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:50,137 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:29:50,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:50,222 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:29:50,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:50,515 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-11-23 21:29:50,516 INFO L343 Elim1Store]: treesize reduction 150, result has 47.9 percent of original size [2019-11-23 21:29:50,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 319 [2019-11-23 21:29:50,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:50,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:50,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:29:50,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:50,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:29:50,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:50,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:50,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:29:50,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:50,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:29:50,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:50,536 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:50,696 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-11-23 21:29:50,696 INFO L567 ElimStorePlain]: treesize reduction 135, result has 71.7 percent of original size [2019-11-23 21:29:50,840 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-23 21:29:50,840 INFO L343 Elim1Store]: treesize reduction 90, result has 68.5 percent of original size [2019-11-23 21:29:50,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 304 treesize of output 345 [2019-11-23 21:29:50,843 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:50,929 INFO L567 ElimStorePlain]: treesize reduction 76, result has 72.4 percent of original size [2019-11-23 21:29:50,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:50,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, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 57 [2019-11-23 21:29:50,940 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:50,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:50,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:50,995 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:483, output treesize:141 [2019-11-23 21:29:51,055 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:51,055 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 80 [2019-11-23 21:29:51,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:51,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:51,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:51,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:51,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:51,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:51,062 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:29:51,117 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-11-23 21:29:51,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:51,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-23 21:29:51,123 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:29:51,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:51,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:51,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:152, output treesize:35 [2019-11-23 21:29:51,171 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:51,172 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 21 [2019-11-23 21:29:51,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:51,187 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-23 21:29:51,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:51,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2019-11-23 21:29:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:51,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:51,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-11-23 21:29:51,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340940655] [2019-11-23 21:29:51,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:29:51,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:51,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:29:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:29:51,198 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-11-23 21:29:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:51,718 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-23 21:29:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:29:51,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-11-23 21:29:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:51,719 INFO L225 Difference]: With dead ends: 72 [2019-11-23 21:29:51,720 INFO L226 Difference]: Without dead ends: 70 [2019-11-23 21:29:51,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:29:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-23 21:29:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2019-11-23 21:29:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 21:29:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-23 21:29:51,726 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 26 [2019-11-23 21:29:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:51,726 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-23 21:29:51,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:29:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-23 21:29:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 21:29:51,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:51,728 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:51,931 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:51,932 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:51,932 INFO L82 PathProgramCache]: Analyzing trace with hash -866838114, now seen corresponding path program 2 times [2019-11-23 21:29:51,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:51,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359663049] [2019-11-23 21:29:51,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:52,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359663049] [2019-11-23 21:29:52,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614749685] [2019-11-23 21:29:52,310 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 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:29:52,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:29:52,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:29:52,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-23 21:29:52,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:52,392 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:29:52,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:29:52,439 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,439 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:29:52,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,521 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.1 percent of original size [2019-11-23 21:29:52,555 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 35 treesize of output 7 [2019-11-23 21:29:52,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,591 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 13 treesize of output 9 [2019-11-23 21:29:52,591 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,625 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 35 treesize of output 7 [2019-11-23 21:29:52,626 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,646 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:44 [2019-11-23 21:29:52,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,726 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:29:52,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,942 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-23 21:29:52,943 INFO L567 ElimStorePlain]: treesize reduction 40, result has 83.5 percent of original size [2019-11-23 21:29:52,945 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_int_39|], 4=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|]} [2019-11-23 21:29:52,958 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 39 treesize of output 15 [2019-11-23 21:29:52,959 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-23 21:29:53,031 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,134 INFO L343 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2019-11-23 21:29:53,134 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 99 [2019-11-23 21:29:53,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:53,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:53,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:53,137 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,206 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.9 percent of original size [2019-11-23 21:29:53,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:53,218 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 59 treesize of output 22 [2019-11-23 21:29:53,219 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,244 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:29:53,244 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:197, output treesize:73 [2019-11-23 21:29:53,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:53,353 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,354 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:29:53,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,455 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_29|, |v_#memory_int_40|], 4=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_26|], 5=[|v_#memory_$Pointer$.base_29|], 10=[|v_#memory_int_42|]} [2019-11-23 21:29:53,469 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 51 treesize of output 11 [2019-11-23 21:29:53,469 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,559 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:29:53,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,660 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:29:53,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 26 [2019-11-23 21:29:53,764 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,029 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-11-23 21:29:54,030 INFO L343 Elim1Store]: treesize reduction 174, result has 44.2 percent of original size [2019-11-23 21:29:54,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 240 treesize of output 222 [2019-11-23 21:29:54,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:29:54,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:29:54,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:29:54,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:29:54,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,051 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:54,195 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-11-23 21:29:54,195 INFO L567 ElimStorePlain]: treesize reduction 98, result has 57.4 percent of original size [2019-11-23 21:29:54,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:54,209 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 60 treesize of output 43 [2019-11-23 21:29:54,210 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:54,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:54,253 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:376, output treesize:160 [2019-11-23 21:29:54,314 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 5=[|#memory_$Pointer$.base|]} [2019-11-23 21:29:54,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2019-11-23 21:29:54,320 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:29:54,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,365 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 87 [2019-11-23 21:29:54,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,370 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:54,420 INFO L567 ElimStorePlain]: treesize reduction 28, result has 65.4 percent of original size [2019-11-23 21:29:54,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:54,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:171, output treesize:41 [2019-11-23 21:29:54,460 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-23 21:29:54,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:54,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:54,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-23 21:29:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:54,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:54,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-11-23 21:29:54,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247573434] [2019-11-23 21:29:54,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 21:29:54,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 21:29:54,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:29:54,494 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 16 states. [2019-11-23 21:29:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:55,316 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-23 21:29:55,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:29:55,317 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-11-23 21:29:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:55,318 INFO L225 Difference]: With dead ends: 70 [2019-11-23 21:29:55,318 INFO L226 Difference]: Without dead ends: 62 [2019-11-23 21:29:55,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-11-23 21:29:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-23 21:29:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2019-11-23 21:29:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 21:29:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-23 21:29:55,327 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 30 [2019-11-23 21:29:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:55,327 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-23 21:29:55,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 21:29:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-23 21:29:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 21:29:55,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:55,328 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:55,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:55,532 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1802282803, now seen corresponding path program 3 times [2019-11-23 21:29:55,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:55,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97524960] [2019-11-23 21:29:55,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:55,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97524960] [2019-11-23 21:29:55,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86490764] [2019-11-23 21:29:55,838 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 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:29:56,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 21:29:56,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:29:56,018 WARN L253 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-23 21:29:56,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:56,030 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:29:56,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:29:56,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,079 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:29:56,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,161 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.7 percent of original size [2019-11-23 21:29:56,168 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 35 treesize of output 7 [2019-11-23 21:29:56,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,191 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 35 treesize of output 7 [2019-11-23 21:29:56,192 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,207 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:29:56,207 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:35 [2019-11-23 21:29:56,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,291 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:29:56,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,391 INFO L567 ElimStorePlain]: treesize reduction 40, result has 81.0 percent of original size [2019-11-23 21:29:56,398 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 76 [2019-11-23 21:29:56,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:56,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,450 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 62 [2019-11-23 21:29:56,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:56,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:56,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:56,452 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,497 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-11-23 21:29:56,498 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:29:56,498 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:165, output treesize:75 [2019-11-23 21:29:56,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:56,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,601 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 37 treesize of output 53 [2019-11-23 21:29:56,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,717 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-23 21:29:56,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,719 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|, |v_#memory_int_43|], 1=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 4=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|]} [2019-11-23 21:29:56,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 19 [2019-11-23 21:29:56,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:56,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:56,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-11-23 21:29:56,867 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:57,025 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-23 21:29:57,026 INFO L567 ElimStorePlain]: treesize reduction 16, result has 95.7 percent of original size [2019-11-23 21:29:57,030 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:29:57,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:57,120 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:29:57,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:57,317 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-23 21:29:57,317 INFO L343 Elim1Store]: treesize reduction 27, result has 83.1 percent of original size [2019-11-23 21:29:57,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 248 treesize of output 272 [2019-11-23 21:29:57,319 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:57,416 INFO L567 ElimStorePlain]: treesize reduction 88, result has 67.5 percent of original size [2019-11-23 21:29:57,485 INFO L343 Elim1Store]: treesize reduction 16, result has 80.5 percent of original size [2019-11-23 21:29:57,485 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 119 [2019-11-23 21:29:57,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,503 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-11-23 21:29:57,591 INFO L567 ElimStorePlain]: treesize reduction 278, result has 29.4 percent of original size [2019-11-23 21:29:57,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:57,592 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:423, output treesize:107 [2019-11-23 21:29:57,889 INFO L343 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-11-23 21:29:57,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 80 [2019-11-23 21:29:57,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:57,906 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:29:57,969 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-11-23 21:29:57,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:57,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:57,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-23 21:29:57,994 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:58,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:58,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:58,009 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:25 [2019-11-23 21:29:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:58,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:58,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-11-23 21:29:58,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618346302] [2019-11-23 21:29:58,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 21:29:58,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:58,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 21:29:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:29:58,105 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 19 states. [2019-11-23 21:29:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:58,639 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-11-23 21:29:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:29:58,640 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-11-23 21:29:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:58,641 INFO L225 Difference]: With dead ends: 82 [2019-11-23 21:29:58,641 INFO L226 Difference]: Without dead ends: 66 [2019-11-23 21:29:58,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:29:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-23 21:29:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-11-23 21:29:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 21:29:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-23 21:29:58,648 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 32 [2019-11-23 21:29:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:58,649 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-23 21:29:58,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 21:29:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-23 21:29:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 21:29:58,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:58,650 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:58,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:58,851 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash -526515315, now seen corresponding path program 3 times [2019-11-23 21:29:58,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:58,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544017008] [2019-11-23 21:29:58,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:59,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544017008] [2019-11-23 21:29:59,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505280407] [2019-11-23 21:29:59,109 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 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:29:59,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 21:29:59,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:29:59,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-23 21:29:59,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:59,243 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:29:59,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:29:59,294 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,294 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:29:59,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,384 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.7 percent of original size [2019-11-23 21:29:59,390 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 35 treesize of output 7 [2019-11-23 21:29:59,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,422 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 35 treesize of output 7 [2019-11-23 21:29:59,422 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,440 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:29:59,440 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:35 [2019-11-23 21:29:59,596 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,596 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:29:59,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,754 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-23 21:29:59,755 INFO L567 ElimStorePlain]: treesize reduction 40, result has 81.0 percent of original size [2019-11-23 21:29:59,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:59,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,771 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 94 [2019-11-23 21:29:59,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:59,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:59,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:59,774 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,828 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.7 percent of original size [2019-11-23 21:29:59,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,850 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 68 [2019-11-23 21:29:59,851 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,903 INFO L567 ElimStorePlain]: treesize reduction 32, result has 67.7 percent of original size [2019-11-23 21:29:59,904 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:29:59,904 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:165, output treesize:67 [2019-11-23 21:29:59,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:59,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,995 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:29:59,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:00,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:00,066 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|], 4=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_34|], 5=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|]} [2019-11-23 21:30:00,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:00,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:00,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:00,158 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:00,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:00,215 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:30:00,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:00,426 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-11-23 21:30:00,427 INFO L343 Elim1Store]: treesize reduction 137, result has 38.6 percent of original size [2019-11-23 21:30:00,427 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 270 treesize of output 188 [2019-11-23 21:30:00,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,433 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:00,503 INFO L567 ElimStorePlain]: treesize reduction 36, result has 85.1 percent of original size [2019-11-23 21:30:00,647 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-11-23 21:30:00,647 INFO L343 Elim1Store]: treesize reduction 90, result has 68.5 percent of original size [2019-11-23 21:30:00,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 257 [2019-11-23 21:30:00,649 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:00,741 INFO L567 ElimStorePlain]: treesize reduction 76, result has 59.8 percent of original size [2019-11-23 21:30:00,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:00,742 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:369, output treesize:116 [2019-11-23 21:30:01,213 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-23 21:30:01,214 INFO L343 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-11-23 21:30:01,214 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 152 treesize of output 147 [2019-11-23 21:30:01,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:01,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:01,330 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:30:01,436 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-11-23 21:30:01,436 INFO L567 ElimStorePlain]: treesize reduction 89, result has 45.4 percent of original size [2019-11-23 21:30:01,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:01,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 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:30:01,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:01,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:01,483 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:30:01,484 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:166, output treesize:18 [2019-11-23 21:30:01,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:01,547 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 22 treesize of output 18 [2019-11-23 21:30:01,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:01,562 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-23 21:30:01,562 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:01,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 21:30:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:01,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:01,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-23 21:30:01,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302342971] [2019-11-23 21:30:01,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 21:30:01,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:01,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 21:30:01,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:30:01,594 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 20 states. [2019-11-23 21:30:02,343 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-11-23 21:30:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:02,529 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-11-23 21:30:02,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:30:02,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-23 21:30:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:02,531 INFO L225 Difference]: With dead ends: 70 [2019-11-23 21:30:02,531 INFO L226 Difference]: Without dead ends: 45 [2019-11-23 21:30:02,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:30:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-23 21:30:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-23 21:30:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-23 21:30:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-11-23 21:30:02,542 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 36 [2019-11-23 21:30:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:02,545 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-11-23 21:30:02,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 21:30:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-11-23 21:30:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 21:30:02,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:02,548 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:02,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:02,764 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:02,764 INFO L82 PathProgramCache]: Analyzing trace with hash 872964086, now seen corresponding path program 4 times [2019-11-23 21:30:02,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:02,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314066331] [2019-11-23 21:30:02,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:03,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314066331] [2019-11-23 21:30:03,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81234416] [2019-11-23 21:30:03,335 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 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:03,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:30:03,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:03,409 WARN L253 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-23 21:30:03,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:03,418 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:03,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:30:03,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,471 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:03,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,541 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.3 percent of original size [2019-11-23 21:30:03,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 35 treesize of output 7 [2019-11-23 21:30:03,547 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,567 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 35 treesize of output 7 [2019-11-23 21:30:03,567 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,580 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:03,580 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:90, output treesize:32 [2019-11-23 21:30:03,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,659 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:30:03,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,767 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-23 21:30:03,769 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.5 percent of original size [2019-11-23 21:30:03,770 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|], 4=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|]} [2019-11-23 21:30:03,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 21:30:03,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,841 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 90 [2019-11-23 21:30:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,843 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-23 21:30:03,930 INFO L567 ElimStorePlain]: treesize reduction 94, result has 56.3 percent of original size [2019-11-23 21:30:03,935 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 59 treesize of output 22 [2019-11-23 21:30:03,935 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,960 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:159, output treesize:81 [2019-11-23 21:30:04,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2019-11-23 21:30:04,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,286 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-11-23 21:30:04,287 INFO L567 ElimStorePlain]: treesize reduction 78, result has 82.6 percent of original size [2019-11-23 21:30:04,293 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_49|, |v_#memory_int_47|], 10=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2019-11-23 21:30:04,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:04,304 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 81 treesize of output 29 [2019-11-23 21:30:04,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2019-11-23 21:30:04,391 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,564 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-11-23 21:30:04,565 INFO L343 Elim1Store]: treesize reduction 73, result has 53.8 percent of original size [2019-11-23 21:30:04,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 281 treesize of output 191 [2019-11-23 21:30:04,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:04,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:04,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:04,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:04,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:04,601 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-23 21:30:05,003 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-11-23 21:30:05,004 INFO L567 ElimStorePlain]: treesize reduction 130, result has 71.4 percent of original size [2019-11-23 21:30:05,328 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-23 21:30:05,329 INFO L343 Elim1Store]: treesize reduction 74, result has 80.1 percent of original size [2019-11-23 21:30:05,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 301 treesize of output 482 [2019-11-23 21:30:05,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:05,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:05,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:05,812 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-23 21:30:05,818 INFO L168 Benchmark]: Toolchain (without parser) took 26095.18 ms. Allocated memory was 144.2 MB in the beginning and 391.1 MB in the end (delta: 246.9 MB). Free memory was 101.0 MB in the beginning and 118.8 MB in the end (delta: -17.7 MB). Peak memory consumption was 249.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,819 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.82 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 169.0 MB in the end (delta: -68.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.66 ms. Allocated memory is still 202.4 MB. Free memory was 169.0 MB in the beginning and 166.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,824 INFO L168 Benchmark]: Boogie Preprocessor took 33.94 ms. Allocated memory is still 202.4 MB. Free memory was 166.9 MB in the beginning and 165.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,825 INFO L168 Benchmark]: RCFGBuilder took 472.39 ms. Allocated memory is still 202.4 MB. Free memory was 165.5 MB in the beginning and 142.0 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,827 INFO L168 Benchmark]: TraceAbstraction took 24954.30 ms. Allocated memory was 202.4 MB in the beginning and 391.1 MB in the end (delta: 188.7 MB). Free memory was 142.0 MB in the beginning and 118.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 232.3 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,831 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 574.82 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 169.0 MB in the end (delta: -68.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.66 ms. Allocated memory is still 202.4 MB. Free memory was 169.0 MB in the beginning and 166.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.94 ms. Allocated memory is still 202.4 MB. Free memory was 166.9 MB in the beginning and 165.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 472.39 ms. Allocated memory is still 202.4 MB. Free memory was 165.5 MB in the beginning and 142.0 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24954.30 ms. Allocated memory was 202.4 MB in the beginning and 391.1 MB in the end (delta: 188.7 MB). Free memory was 142.0 MB in the beginning and 118.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 232.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...