/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/list-ext3-properties/dll_nullified-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:57:42,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:57:42,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:57:42,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:57:42,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:57:42,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:57:42,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:57:42,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:57:42,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:57:42,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:57:42,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:57:42,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:57:42,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:57:42,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:57:42,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:57:42,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:57:42,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:57:42,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:57:42,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:57:42,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:57:42,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:57:42,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:57:42,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:57:42,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:57:42,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:57:42,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:57:42,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:57:42,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:57:42,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:57:42,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:57:42,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:57:42,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:57:42,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:57:42,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:57:42,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:57:42,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:57:42,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:57:42,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:57:42,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:57:42,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:57:42,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:57:42,948 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:57:42,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:57:42,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:57:42,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:57:42,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:57:42,963 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:57:42,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:57:42,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:57:42,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:57:42,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:57:42,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:57:42,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:57:42,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:57:42,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:57:42,965 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:57:42,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:57:42,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:57:42,966 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:57:42,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:57:42,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:57:42,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:57:42,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:57:42,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:57:42,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:57:42,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:57:42,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:57:42,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:57:42,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:57:42,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:57:42,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:57:42,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:57:43,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:57:43,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:57:43,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:57:43,247 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:57:43,247 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:57:43,248 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2019-11-23 21:57:43,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29275fd7f/410c0ccd23f647a894e47823d8d709f3/FLAGa9c6de018 [2019-11-23 21:57:43,779 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:57:43,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2019-11-23 21:57:43,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29275fd7f/410c0ccd23f647a894e47823d8d709f3/FLAGa9c6de018 [2019-11-23 21:57:44,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29275fd7f/410c0ccd23f647a894e47823d8d709f3 [2019-11-23 21:57:44,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:57:44,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:57:44,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:44,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:57:44,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:57:44,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27090b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44, skipping insertion in model container [2019-11-23 21:57:44,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:57:44,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:57:44,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:44,652 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:57:44,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:44,751 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:57:44,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44 WrapperNode [2019-11-23 21:57:44,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:44,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:44,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:57:44,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:57:44,762 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:57:44" (1/1) ... [2019-11-23 21:57:44,780 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:57:44" (1/1) ... [2019-11-23 21:57:44,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:44,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:57:44,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:57:44,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:57:44,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (1/1) ... [2019-11-23 21:57:44,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:57:44,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:57:44,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:57:44,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:57:44,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (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:57:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:57:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:57:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:57:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:57:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:57:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:57:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:57:44,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:57:45,374 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:57:45,374 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-23 21:57:45,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:45 BoogieIcfgContainer [2019-11-23 21:57:45,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:57:45,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:57:45,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:57:45,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:57:45,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:57:44" (1/3) ... [2019-11-23 21:57:45,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc6a13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:45, skipping insertion in model container [2019-11-23 21:57:45,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:44" (2/3) ... [2019-11-23 21:57:45,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc6a13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:45, skipping insertion in model container [2019-11-23 21:57:45,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:45" (3/3) ... [2019-11-23 21:57:45,385 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2019-11-23 21:57:45,397 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:57:45,405 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:57:45,420 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:57:45,448 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:57:45,448 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:57:45,448 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:57:45,448 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:57:45,449 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:57:45,449 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:57:45,449 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:57:45,450 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:57:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-23 21:57:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 21:57:45,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:45,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:45,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,482 INFO L82 PathProgramCache]: Analyzing trace with hash -91270904, now seen corresponding path program 1 times [2019-11-23 21:57:45,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878787992] [2019-11-23 21:57:45,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,665 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:57:45,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878787992] [2019-11-23 21:57:45,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:45,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:57:45,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184752613] [2019-11-23 21:57:45,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:57:45,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:45,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:57:45,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:57:45,696 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-11-23 21:57:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:45,741 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2019-11-23 21:57:45,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:57:45,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-23 21:57:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:45,754 INFO L225 Difference]: With dead ends: 52 [2019-11-23 21:57:45,754 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 21:57:45,758 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:57:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 21:57:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-23 21:57:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-23 21:57:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-23 21:57:45,798 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2019-11-23 21:57:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:45,798 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-23 21:57:45,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:57:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-23 21:57:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 21:57:45,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:45,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:45,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1034399597, now seen corresponding path program 1 times [2019-11-23 21:57:45,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388553839] [2019-11-23 21:57:45,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:45,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388553839] [2019-11-23 21:57:45,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:45,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:57:45,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024688843] [2019-11-23 21:57:45,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:57:45,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:45,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:57:45,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:57:45,916 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-11-23 21:57:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:45,966 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2019-11-23 21:57:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:57:45,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 21:57:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:45,971 INFO L225 Difference]: With dead ends: 47 [2019-11-23 21:57:45,971 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 21:57:45,972 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:57:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 21:57:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-23 21:57:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 21:57:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-23 21:57:45,978 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2019-11-23 21:57:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:45,978 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-23 21:57:45,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:57:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-11-23 21:57:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 21:57:45,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:45,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:45,980 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,980 INFO L82 PathProgramCache]: Analyzing trace with hash -776234159, now seen corresponding path program 1 times [2019-11-23 21:57:45,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336340421] [2019-11-23 21:57:45,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:46,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336340421] [2019-11-23 21:57:46,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186517091] [2019-11-23 21:57:46,068 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:57:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:57:46,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:46,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:46,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-23 21:57:46,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510376748] [2019-11-23 21:57:46,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:57:46,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:46,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:57:46,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:46,266 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 5 states. [2019-11-23 21:57:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:46,303 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-11-23 21:57:46,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:57:46,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-23 21:57:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:46,305 INFO L225 Difference]: With dead ends: 47 [2019-11-23 21:57:46,305 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 21:57:46,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:46,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 21:57:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-23 21:57:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 21:57:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-23 21:57:46,311 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2019-11-23 21:57:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:46,311 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-23 21:57:46,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:57:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-11-23 21:57:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:57:46,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:46,313 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:57:46,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:46,514 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:46,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:46,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1239157738, now seen corresponding path program 1 times [2019-11-23 21:57:46,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:46,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505885273] [2019-11-23 21:57:46,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:46,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505885273] [2019-11-23 21:57:46,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078997237] [2019-11-23 21:57:46,680 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:57:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:57:46,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:46,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:46,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 21:57:46,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932926838] [2019-11-23 21:57:46,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:57:46,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:57:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:57:46,809 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 6 states. [2019-11-23 21:57:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:46,876 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-23 21:57:46,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:57:46,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-23 21:57:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:46,878 INFO L225 Difference]: With dead ends: 52 [2019-11-23 21:57:46,878 INFO L226 Difference]: Without dead ends: 37 [2019-11-23 21:57:46,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:57:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-23 21:57:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-11-23 21:57:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 21:57:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-23 21:57:46,885 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-23 21:57:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:46,885 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-23 21:57:46,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:57:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-23 21:57:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 21:57:46,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:46,886 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:47,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:47,089 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 160895729, now seen corresponding path program 2 times [2019-11-23 21:57:47,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:47,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152514719] [2019-11-23 21:57:47,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:47,252 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:57:47,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152514719] [2019-11-23 21:57:47,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970314397] [2019-11-23 21:57:47,253 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:47,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:47,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:47,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 21:57:47,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:47,379 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:57:47,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:47,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-23 21:57:47,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810792341] [2019-11-23 21:57:47,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:57:47,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:47,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:57:47,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:57:47,382 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 7 states. [2019-11-23 21:57:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:47,432 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-11-23 21:57:47,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:57:47,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-23 21:57:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:47,433 INFO L225 Difference]: With dead ends: 57 [2019-11-23 21:57:47,433 INFO L226 Difference]: Without dead ends: 42 [2019-11-23 21:57:47,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:57:47,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-23 21:57:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-11-23 21:57:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-23 21:57:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-11-23 21:57:47,447 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 27 [2019-11-23 21:57:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:47,450 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-23 21:57:47,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:57:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2019-11-23 21:57:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 21:57:47,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:47,452 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:47,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:47,659 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:47,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash -459646902, now seen corresponding path program 3 times [2019-11-23 21:57:47,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:47,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55560073] [2019-11-23 21:57:47,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:47,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55560073] [2019-11-23 21:57:47,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571944764] [2019-11-23 21:57:47,793 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:47,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 21:57:47,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:47,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-23 21:57:48,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:48,040 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:57:48,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:48,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:48,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-23 21:57:48,137 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_17|], 2=[|v_#memory_int_16|]} [2019-11-23 21:57:48,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-11-23 21:57:48,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:57:48,211 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:33 [2019-11-23 21:57:48,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:48,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:57:48,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,281 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:57:48,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:29 [2019-11-23 21:57:48,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 21:57:48,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:48,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2019-11-23 21:57:48,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715243262] [2019-11-23 21:57:48,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 21:57:48,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:48,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 21:57:48,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:57:48,455 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 16 states. [2019-11-23 21:57:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:49,763 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-11-23 21:57:49,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:57:49,764 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-23 21:57:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:49,765 INFO L225 Difference]: With dead ends: 78 [2019-11-23 21:57:49,765 INFO L226 Difference]: Without dead ends: 63 [2019-11-23 21:57:49,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 21:57:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-23 21:57:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2019-11-23 21:57:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 21:57:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-11-23 21:57:49,774 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 32 [2019-11-23 21:57:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:49,774 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-23 21:57:49,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 21:57:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2019-11-23 21:57:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 21:57:49,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:49,775 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:49,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:49,981 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:49,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:49,981 INFO L82 PathProgramCache]: Analyzing trace with hash -908742253, now seen corresponding path program 1 times [2019-11-23 21:57:49,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:49,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312945939] [2019-11-23 21:57:49,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 21:57:50,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312945939] [2019-11-23 21:57:50,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217508698] [2019-11-23 21:57:50,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:50,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 21:57:50,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:50,481 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:57:50,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:50,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:50,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-23 21:57:50,514 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_int_19|]} [2019-11-23 21:57:50,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-11-23 21:57:50,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:57:50,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:33 [2019-11-23 21:57:50,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:57:50,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,661 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:57:50,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:29 [2019-11-23 21:57:50,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 21:57:50,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:50,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2019-11-23 21:57:50,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112354650] [2019-11-23 21:57:50,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:57:50,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:57:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:57:50,788 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 18 states. [2019-11-23 21:57:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:51,498 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-11-23 21:57:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:57:51,499 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-11-23 21:57:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:51,500 INFO L225 Difference]: With dead ends: 76 [2019-11-23 21:57:51,501 INFO L226 Difference]: Without dead ends: 63 [2019-11-23 21:57:51,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2019-11-23 21:57:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-23 21:57:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2019-11-23 21:57:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 21:57:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2019-11-23 21:57:51,509 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 37 [2019-11-23 21:57:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:51,509 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2019-11-23 21:57:51,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:57:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2019-11-23 21:57:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 21:57:51,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:51,511 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:51,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:51,715 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash 829738032, now seen corresponding path program 1 times [2019-11-23 21:57:51,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:51,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556165642] [2019-11-23 21:57:51,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 21:57:51,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556165642] [2019-11-23 21:57:51,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695290776] [2019-11-23 21:57:51,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:51,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 21:57:51,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:51,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:57:51,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:51,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:51,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:51,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:57:52,045 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:52,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-23 21:57:52,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:52,084 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 18 treesize of output 19 [2019-11-23 21:57:52,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2019-11-23 21:57:52,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:52,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,189 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 110 [2019-11-23 21:57:52,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:52,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:52,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:52,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 21:57:52,231 INFO L567 ElimStorePlain]: treesize reduction 147, result has 24.6 percent of original size [2019-11-23 21:57:52,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:52,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2019-11-23 21:57:52,409 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2019-11-23 21:57:52,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,418 INFO L567 ElimStorePlain]: treesize reduction 14, result has 39.1 percent of original size [2019-11-23 21:57:52,419 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:57:52,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2019-11-23 21:57:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 21:57:52,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:52,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-11-23 21:57:52,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697497007] [2019-11-23 21:57:52,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 21:57:52,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 21:57:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:57:52,449 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 21 states. [2019-11-23 21:57:53,143 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-23 21:57:53,584 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-11-23 21:57:53,803 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-11-23 21:57:54,044 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-11-23 21:57:54,330 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-23 21:57:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:54,351 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2019-11-23 21:57:54,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:57:54,352 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-11-23 21:57:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:54,353 INFO L225 Difference]: With dead ends: 94 [2019-11-23 21:57:54,353 INFO L226 Difference]: Without dead ends: 56 [2019-11-23 21:57:54,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 21:57:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-23 21:57:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2019-11-23 21:57:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 21:57:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-11-23 21:57:54,364 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 38 [2019-11-23 21:57:54,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:54,364 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-11-23 21:57:54,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 21:57:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-11-23 21:57:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 21:57:54,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:54,366 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:54,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:54,591 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash 731872996, now seen corresponding path program 1 times [2019-11-23 21:57:54,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:54,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388754690] [2019-11-23 21:57:54,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:57:55,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388754690] [2019-11-23 21:57:55,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607600918] [2019-11-23 21:57:55,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:55,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-23 21:57:55,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:55,375 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:57:55,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:55,418 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,418 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:57:55,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,442 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-23 21:57:55,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-23 21:57:55,478 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_int_22|]} [2019-11-23 21:57:55,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-11-23 21:57:55,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:57:55,547 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,561 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-11-23 21:57:55,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:57:55,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:55,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-11-23 21:57:55,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,761 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:57:55,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:32 [2019-11-23 21:57:55,823 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_15|, |v_#memory_$Pointer$.base_17|], 2=[|v_#memory_int_23|], 24=[|v_#memory_int_26|]} [2019-11-23 21:57:55,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,831 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 18 treesize of output 19 [2019-11-23 21:57:55,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,895 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 18 treesize of output 19 [2019-11-23 21:57:55,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,954 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:57:55,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 65 [2019-11-23 21:57:56,013 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,045 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:93 [2019-11-23 21:57:56,124 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|], 30=[|v_#memory_int_27|]} [2019-11-23 21:57:56,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:57:56,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,147 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 101 [2019-11-23 21:57:56,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,237 INFO L567 ElimStorePlain]: treesize reduction 30, result has 85.3 percent of original size [2019-11-23 21:57:56,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,244 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-11-23 21:57:56,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-11-23 21:57:56,294 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,326 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:184, output treesize:131 [2019-11-23 21:57:56,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 53 [2019-11-23 21:57:56,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,707 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-11-23 21:57:56,713 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 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-23 21:57:56,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,729 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:57:56,729 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:50 [2019-11-23 21:57:56,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 21:57:56,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:56,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2019-11-23 21:57:56,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54106387] [2019-11-23 21:57:56,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 21:57:56,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:56,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 21:57:56,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2019-11-23 21:57:56,796 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 31 states. [2019-11-23 21:57:57,931 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-11-23 21:57:58,192 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-11-23 21:57:59,124 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 125 [2019-11-23 21:57:59,736 WARN L192 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 159 [2019-11-23 21:58:00,363 WARN L192 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 161 [2019-11-23 21:58:00,879 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 135 [2019-11-23 21:58:01,363 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 137 [2019-11-23 21:58:01,795 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-11-23 21:58:02,237 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 137 [2019-11-23 21:58:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:02,287 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-11-23 21:58:02,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:58:02,287 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2019-11-23 21:58:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:02,288 INFO L225 Difference]: With dead ends: 85 [2019-11-23 21:58:02,289 INFO L226 Difference]: Without dead ends: 72 [2019-11-23 21:58:02,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=477, Invalid=1875, Unknown=0, NotChecked=0, Total=2352 [2019-11-23 21:58:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-23 21:58:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-11-23 21:58:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-23 21:58:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-11-23 21:58:02,309 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2019-11-23 21:58:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:02,309 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-23 21:58:02,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 21:58:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-11-23 21:58:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 21:58:02,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:02,314 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:02,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:02,528 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:02,529 INFO L82 PathProgramCache]: Analyzing trace with hash 733720038, now seen corresponding path program 1 times [2019-11-23 21:58:02,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:02,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452657790] [2019-11-23 21:58:02,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:58:03,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452657790] [2019-11-23 21:58:03,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438493241] [2019-11-23 21:58:03,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:03,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-23 21:58:03,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:03,160 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:58:03,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:58:03,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,192 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:58:03,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,213 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-23 21:58:03,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-23 21:58:03,242 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 2=[|v_#memory_int_28|]} [2019-11-23 21:58:03,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-11-23 21:58:03,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:58:03,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-11-23 21:58:03,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:58:03,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:03,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-11-23 21:58:03,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,491 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:58:03,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2019-11-23 21:58:03,542 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.offset_17|], 2=[|v_#memory_int_29|], 24=[|v_#memory_int_32|]} [2019-11-23 21:58:03,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,557 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 18 treesize of output 19 [2019-11-23 21:58:03,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,624 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 18 treesize of output 19 [2019-11-23 21:58:03,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,681 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:58:03,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 65 [2019-11-23 21:58:03,738 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,770 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:90 [2019-11-23 21:58:03,838 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_20|], 30=[|v_#memory_int_33|]} [2019-11-23 21:58:03,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,845 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-11-23 21:58:03,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:03,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,930 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 139 [2019-11-23 21:58:03,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:03,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:03,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:03,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:03,934 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,052 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-23 21:58:04,053 INFO L567 ElimStorePlain]: treesize reduction 584, result has 21.6 percent of original size [2019-11-23 21:58:04,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:04,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:04,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:04,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-11-23 21:58:04,064 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,097 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:181, output treesize:128 [2019-11-23 21:58:04,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:04,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 73 [2019-11-23 21:58:04,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,494 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.9 percent of original size [2019-11-23 21:58:04,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:04,499 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 0 case distinctions, treesize of input 35 treesize of output 13 [2019-11-23 21:58:04,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,517 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:58:04,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:146, output treesize:54 [2019-11-23 21:58:04,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 21:58:04,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:04,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-11-23 21:58:04,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861146450] [2019-11-23 21:58:04,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 21:58:04,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 21:58:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-11-23 21:58:04,587 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 29 states. [2019-11-23 21:58:05,527 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-11-23 21:58:05,725 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2019-11-23 21:58:06,004 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2019-11-23 21:58:06,179 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-11-23 21:58:06,821 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 138 [2019-11-23 21:58:07,472 WARN L192 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 175 [2019-11-23 21:58:08,167 WARN L192 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 177 [2019-11-23 21:58:08,888 WARN L192 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 179 [2019-11-23 21:58:09,438 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 148 [2019-11-23 21:58:09,969 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 150 [2019-11-23 21:58:10,552 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 152 [2019-11-23 21:58:10,992 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 125 [2019-11-23 21:58:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:11,077 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2019-11-23 21:58:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:58:11,078 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 43 [2019-11-23 21:58:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:11,079 INFO L225 Difference]: With dead ends: 82 [2019-11-23 21:58:11,079 INFO L226 Difference]: Without dead ends: 69 [2019-11-23 21:58:11,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=436, Invalid=1726, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 21:58:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-23 21:58:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-11-23 21:58:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 21:58:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-23 21:58:11,089 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 43 [2019-11-23 21:58:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:11,089 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-23 21:58:11,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 21:58:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-23 21:58:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 21:58:11,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:11,090 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:11,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:11,298 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash 206461501, now seen corresponding path program 1 times [2019-11-23 21:58:11,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:11,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123708456] [2019-11-23 21:58:11,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:58:11,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123708456] [2019-11-23 21:58:11,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669721582] [2019-11-23 21:58:11,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:58:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:11,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-23 21:58:11,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:11,922 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:58:11,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:11,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:11,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:11,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:58:11,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:11,953 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:58:11,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:11,973 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-23 21:58:11,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:11,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-23 21:58:12,003 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_int_34|]} [2019-11-23 21:58:12,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-11-23 21:58:12,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:58:12,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,072 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-11-23 21:58:12,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:58:12,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:12,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-11-23 21:58:12,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,222 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:58:12,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2019-11-23 21:58:12,268 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_21|], 2=[|v_#memory_int_35|], 24=[|v_#memory_int_38|]} [2019-11-23 21:58:12,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,279 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 18 treesize of output 19 [2019-11-23 21:58:12,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,345 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 18 treesize of output 19 [2019-11-23 21:58:12,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,397 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:58:12,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 65 [2019-11-23 21:58:12,463 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,514 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:90 [2019-11-23 21:58:12,590 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|], 30=[|v_#memory_int_39|]} [2019-11-23 21:58:12,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,641 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 143 [2019-11-23 21:58:12,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:12,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:12,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:12,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-11-23 21:58:12,789 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-11-23 21:58:12,790 INFO L567 ElimStorePlain]: treesize reduction 1234, result has 12.2 percent of original size [2019-11-23 21:58:12,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,796 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-11-23 21:58:12,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-11-23 21:58:12,847 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,878 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:181, output treesize:128 [2019-11-23 21:58:13,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:13,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:13,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 73 [2019-11-23 21:58:13,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,239 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.9 percent of original size [2019-11-23 21:58:13,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:13,245 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 0 case distinctions, treesize of input 35 treesize of output 13 [2019-11-23 21:58:13,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:13,264 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:58:13,265 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:146, output treesize:54 [2019-11-23 21:58:13,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 21:58:13,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:13,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2019-11-23 21:58:13,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719594006] [2019-11-23 21:58:13,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 21:58:13,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:13,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 21:58:13,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2019-11-23 21:58:13,333 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 28 states. [2019-11-23 21:58:14,372 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-11-23 21:58:14,658 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-11-23 21:58:15,060 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-11-23 21:58:15,519 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 137 [2019-11-23 21:58:16,180 WARN L192 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 174 [2019-11-23 21:58:16,749 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 147 [2019-11-23 21:58:17,274 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 149 [2019-11-23 21:58:17,750 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 126 [2019-11-23 21:58:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:17,844 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2019-11-23 21:58:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:58:17,845 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2019-11-23 21:58:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:17,846 INFO L225 Difference]: With dead ends: 76 [2019-11-23 21:58:17,846 INFO L226 Difference]: Without dead ends: 69 [2019-11-23 21:58:17,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=367, Invalid=1525, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 21:58:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-23 21:58:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2019-11-23 21:58:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 21:58:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-11-23 21:58:17,856 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 44 [2019-11-23 21:58:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:17,856 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-11-23 21:58:17,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-23 21:58:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-11-23 21:58:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 21:58:17,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:17,857 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:18,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:18,062 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:18,062 INFO L82 PathProgramCache]: Analyzing trace with hash 208308543, now seen corresponding path program 1 times [2019-11-23 21:58:18,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:18,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475930033] [2019-11-23 21:58:18,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:58:18,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475930033] [2019-11-23 21:58:18,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039372400] [2019-11-23 21:58:18,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:18,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-23 21:58:18,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:18,673 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:58:18,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:18,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:18,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:18,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:18,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:18,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:18,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:18,788 INFO L567 ElimStorePlain]: treesize reduction 14, result has 61.1 percent of original size [2019-11-23 21:58:18,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:18,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2019-11-23 21:58:18,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:18,820 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 18 treesize of output 19 [2019-11-23 21:58:18,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:18,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:18,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:18,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:40 [2019-11-23 21:58:18,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:18,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:18,924 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 115 [2019-11-23 21:58:18,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:18,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:18,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 21:58:18,980 INFO L567 ElimStorePlain]: treesize reduction 158, result has 28.8 percent of original size [2019-11-23 21:58:18,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:18,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:64 [2019-11-23 21:58:19,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:19,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:58:19,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:19,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:19,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:19,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:52 [2019-11-23 21:58:19,172 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_21|], 2=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_25|], 4=[|v_#memory_$Pointer$.base_26|], 10=[|v_#memory_$Pointer$.base_28|]} [2019-11-23 21:58:19,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,197 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 18 treesize of output 19 [2019-11-23 21:58:19,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:19,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:19,296 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:58:19,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:19,369 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:58:19,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:19,426 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:58:19,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:19,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,681 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-23 21:58:19,682 INFO L343 Elim1Store]: treesize reduction 110, result has 64.5 percent of original size [2019-11-23 21:58:19,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 278 [2019-11-23 21:58:19,685 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:19,798 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-11-23 21:58:19,799 INFO L567 ElimStorePlain]: treesize reduction 244, result has 31.7 percent of original size [2019-11-23 21:58:19,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:19,800 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:141, output treesize:88 [2019-11-23 21:58:19,876 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_22|], 25=[|v_#memory_$Pointer$.base_29|]} [2019-11-23 21:58:19,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:19,881 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-11-23 21:58:19,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:19,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:19,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:20,151 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-23 21:58:20,151 INFO L343 Elim1Store]: treesize reduction 32, result has 86.3 percent of original size [2019-11-23 21:58:20,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 142 treesize of output 254 [2019-11-23 21:58:20,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:20,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-23 21:58:20,431 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-11-23 21:58:20,431 INFO L567 ElimStorePlain]: treesize reduction 1715, result has 7.4 percent of original size [2019-11-23 21:58:20,432 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:58:20,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:170, output treesize:137 [2019-11-23 21:58:20,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:20,759 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 0 case distinctions, treesize of input 41 treesize of output 13 [2019-11-23 21:58:20,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:20,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:20,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:20,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:155, output treesize:118 [2019-11-23 21:58:20,959 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-23 21:58:20,959 INFO L343 Elim1Store]: treesize reduction 12, result has 90.7 percent of original size [2019-11-23 21:58:20,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 151 [2019-11-23 21:58:20,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:20,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,001 INFO L567 ElimStorePlain]: treesize reduction 329, result has 2.7 percent of original size [2019-11-23 21:58:21,001 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:58:21,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:119, output treesize:4 [2019-11-23 21:58:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 21:58:21,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:21,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-11-23 21:58:21,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587525241] [2019-11-23 21:58:21,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-23 21:58:21,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-23 21:58:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 21:58:21,051 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 33 states. [2019-11-23 21:58:22,401 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-11-23 21:58:22,635 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-11-23 21:58:23,000 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2019-11-23 21:58:23,229 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-11-23 21:58:23,870 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 139 [2019-11-23 21:58:24,579 WARN L192 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 174 [2019-11-23 21:58:25,307 WARN L192 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 172 [2019-11-23 21:58:25,934 WARN L192 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 175 [2019-11-23 21:58:26,465 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 114 [2019-11-23 21:58:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:26,489 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2019-11-23 21:58:26,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 21:58:26,490 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2019-11-23 21:58:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:26,490 INFO L225 Difference]: With dead ends: 71 [2019-11-23 21:58:26,490 INFO L226 Difference]: Without dead ends: 62 [2019-11-23 21:58:26,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=441, Invalid=2109, Unknown=0, NotChecked=0, Total=2550 [2019-11-23 21:58:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-23 21:58:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2019-11-23 21:58:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 21:58:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-11-23 21:58:26,502 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 44 [2019-11-23 21:58:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:26,503 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-11-23 21:58:26,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-23 21:58:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-11-23 21:58:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 21:58:26,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:26,504 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:26,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:26,708 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1765953289, now seen corresponding path program 2 times [2019-11-23 21:58:26,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:26,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826925541] [2019-11-23 21:58:26,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:27,389 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 27 [2019-11-23 21:58:27,659 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-11-23 21:58:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 21:58:28,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826925541] [2019-11-23 21:58:28,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535727167] [2019-11-23 21:58:28,031 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:28,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:58:28,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:28,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-23 21:58:28,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:28,147 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:58:28,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:58:28,209 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,209 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:58:28,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,229 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-23 21:58:28,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-23 21:58:28,263 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_int_40|]} [2019-11-23 21:58:28,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-11-23 21:58:28,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:58:28,315 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,327 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-11-23 21:58:28,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:58:28,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:28,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-11-23 21:58:28,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,531 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 22 treesize of output 69 [2019-11-23 21:58:28,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,589 INFO L567 ElimStorePlain]: treesize reduction 28, result has 66.3 percent of original size [2019-11-23 21:58:28,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:28,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:55 [2019-11-23 21:58:28,686 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_23|, |v_#memory_$Pointer$.base_30|], 2=[|v_#memory_int_41|], 24=[|v_#memory_int_45|]} [2019-11-23 21:58:28,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,694 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 18 treesize of output 19 [2019-11-23 21:58:28,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,776 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 18 treesize of output 19 [2019-11-23 21:58:28,777 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,844 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:58:28,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:28,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 16 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 65 [2019-11-23 21:58:28,918 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:28,973 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:142, output treesize:116 [2019-11-23 21:58:29,100 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_27|], 30=[|v_#memory_int_46|]} [2019-11-23 21:58:29,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:29,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:29,127 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:29,127 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 110 [2019-11-23 21:58:29,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:29,260 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-11-23 21:58:29,261 INFO L567 ElimStorePlain]: treesize reduction 30, result has 87.4 percent of original size [2019-11-23 21:58:29,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:29,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-11-23 21:58:29,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:29,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:29,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:29,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:29,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:29,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-11-23 21:58:29,334 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:29,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:29,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:29,376 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:219, output treesize:166 [2019-11-23 21:58:29,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:29,603 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 25 treesize of output 41 [2019-11-23 21:58:29,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:29,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:29,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:29,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:148, output treesize:124 [2019-11-23 21:58:29,768 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_31|, |v_#memory_int_42|, |v_#memory_$Pointer$.base_32|], 4=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_33|], 7=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_28|], 51=[|v_#memory_int_47|]} [2019-11-23 21:58:29,782 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:58:30,601 WARN L192 SmtUtils]: Spent 818.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-23 21:58:30,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:30,611 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:58:31,060 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-23 21:58:31,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,068 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:58:31,411 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-23 21:58:31,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,416 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:58:31,694 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-23 21:58:31,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,700 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:58:31,940 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-23 21:58:31,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,945 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:58:32,138 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-23 21:58:32,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:32,143 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:32,276 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-23 21:58:32,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:32,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,316 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:32,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:32,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 16 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 134 [2019-11-23 21:58:32,339 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:32,551 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-23 21:58:32,552 INFO L567 ElimStorePlain]: treesize reduction 48, result has 82.8 percent of original size [2019-11-23 21:58:32,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 78 [2019-11-23 21:58:32,583 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:32,685 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-23 21:58:32,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:32,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 107 [2019-11-23 21:58:32,711 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:32,819 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-23 21:58:32,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:32,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:32,820 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:317, output treesize:181 [2019-11-23 21:58:32,980 INFO L392 ElimStorePlain]: Different costs {21=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_36|], 51=[|v_#memory_int_48|]} [2019-11-23 21:58:32,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:32,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2019-11-23 21:58:32,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:33,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:33,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:33,094 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:33,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:33,151 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:33,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 269 treesize of output 207 [2019-11-23 21:58:33,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:33,433 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-11-23 21:58:33,433 INFO L567 ElimStorePlain]: treesize reduction 192, result has 58.6 percent of original size [2019-11-23 21:58:33,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:33,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:33,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:33,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:33,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:33,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2019-11-23 21:58:33,446 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:33,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:33,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:33,501 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:338, output treesize:239 [2019-11-23 21:58:34,088 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:34,122 INFO L343 Elim1Store]: treesize reduction 8, result has 81.8 percent of original size [2019-11-23 21:58:34,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 199 treesize of output 134 [2019-11-23 21:58:34,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,131 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:58:34,217 INFO L567 ElimStorePlain]: treesize reduction 24, result has 83.8 percent of original size [2019-11-23 21:58:34,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:34,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 40 [2019-11-23 21:58:34,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:34,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:34,251 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:58:34,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:234, output treesize:79 [2019-11-23 21:58:34,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 45 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:34,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:34,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2019-11-23 21:58:34,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111467446] [2019-11-23 21:58:34,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-23 21:58:34,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:34,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-23 21:58:34,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 21:58:34,361 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 41 states. [2019-11-23 21:58:35,177 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-11-23 21:58:35,636 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2019-11-23 21:58:35,947 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 78 [2019-11-23 21:58:36,308 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-11-23 21:58:36,492 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-11-23 21:58:36,770 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-23 21:58:37,163 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 90 [2019-11-23 21:58:37,686 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 135 [2019-11-23 21:58:37,914 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-11-23 21:58:38,358 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-11-23 21:58:39,211 WARN L192 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 185 [2019-11-23 21:58:40,474 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 254 DAG size of output: 235 [2019-11-23 21:58:41,770 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 256 DAG size of output: 237 [2019-11-23 21:58:42,791 WARN L192 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 239 [2019-11-23 21:58:43,721 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 241 [2019-11-23 21:58:44,720 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 195 [2019-11-23 21:58:45,653 WARN L192 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 197 [2019-11-23 21:58:46,452 WARN L192 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 166 [2019-11-23 21:58:47,386 WARN L192 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 197 [2019-11-23 21:58:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:47,457 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2019-11-23 21:58:47,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 21:58:47,458 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 49 [2019-11-23 21:58:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:47,459 INFO L225 Difference]: With dead ends: 91 [2019-11-23 21:58:47,459 INFO L226 Difference]: Without dead ends: 78 [2019-11-23 21:58:47,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=845, Invalid=3445, Unknown=0, NotChecked=0, Total=4290 [2019-11-23 21:58:47,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-23 21:58:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2019-11-23 21:58:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-23 21:58:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-11-23 21:58:47,473 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 49 [2019-11-23 21:58:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:47,473 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-11-23 21:58:47,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-23 21:58:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-11-23 21:58:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 21:58:47,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:47,474 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:47,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:47,678 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1764106247, now seen corresponding path program 2 times [2019-11-23 21:58:47,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:47,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528359584] [2019-11-23 21:58:47,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:48,635 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-11-23 21:58:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 37 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 21:58:49,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528359584] [2019-11-23 21:58:49,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001113048] [2019-11-23 21:58:49,288 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:49,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:58:49,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:49,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 91 conjunts are in the unsatisfiable core [2019-11-23 21:58:49,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:49,395 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:58:49,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:49,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:49,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:49,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:58:49,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:49,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:58:49,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:49,472 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-23 21:58:49,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:49,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-23 21:58:49,507 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_52|], 2=[|v_#memory_int_49|]} [2019-11-23 21:58:49,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-11-23 21:58:49,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:49,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:49,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:58:49,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:49,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:49,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:49,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-11-23 21:58:49,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:58:49,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:49,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:49,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:49,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-11-23 21:58:49,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:49,796 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 22 treesize of output 69 [2019-11-23 21:58:49,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:49,847 INFO L567 ElimStorePlain]: treesize reduction 28, result has 66.3 percent of original size [2019-11-23 21:58:49,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:49,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:55 [2019-11-23 21:58:49,967 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_30|], 2=[|v_#memory_int_50|], 24=[|v_#memory_int_54|]} [2019-11-23 21:58:49,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:49,984 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 18 treesize of output 19 [2019-11-23 21:58:49,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:50,108 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-23 21:58:50,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:50,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-23 21:58:50,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:50,235 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-23 21:58:50,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:50,241 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:58:50,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:50,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 16 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 65 [2019-11-23 21:58:50,349 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:50,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:50,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:50,421 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:142, output treesize:116 [2019-11-23 21:58:50,598 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_34|, |v_#memory_$Pointer$.base_41|], 30=[|v_#memory_int_55|]} [2019-11-23 21:58:50,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-11-23 21:58:50,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:50,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:50,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:50,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:50,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 106 [2019-11-23 21:58:50,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:50,921 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-23 21:58:50,921 INFO L567 ElimStorePlain]: treesize reduction 30, result has 86.9 percent of original size [2019-11-23 21:58:50,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:50,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-11-23 21:58:50,933 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:51,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:51,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:51,009 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:219, output treesize:166 [2019-11-23 21:58:51,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:51,401 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 25 treesize of output 41 [2019-11-23 21:58:51,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:51,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:51,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:51,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:148, output treesize:124 [2019-11-23 21:58:51,618 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_32|, |v_#memory_int_51|, |v_#memory_$Pointer$.offset_31|], 4=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_40|], 7=[|v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_42|], 51=[|v_#memory_int_56|]} [2019-11-23 21:58:51,626 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:58:52,170 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-23 21:58:52,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:52,176 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:58:52,499 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-23 21:58:52,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:52,506 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:58:52,789 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-23 21:58:52,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:52,797 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:58:53,005 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-23 21:58:53,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,010 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:58:53,189 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-23 21:58:53,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,194 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:58:53,343 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-23 21:58:53,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,353 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:53,459 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-23 21:58:53,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 78 [2019-11-23 21:58:53,495 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,602 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-23 21:58:53,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,631 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:53,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 16 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 134 [2019-11-23 21:58:53,651 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,918 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-11-23 21:58:53,919 INFO L567 ElimStorePlain]: treesize reduction 44, result has 84.7 percent of original size [2019-11-23 21:58:53,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:53,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 107 [2019-11-23 21:58:53,949 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,049 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:317, output treesize:181 [2019-11-23 21:58:54,208 INFO L392 ElimStorePlain]: Different costs {21=[|v_#memory_$Pointer$.offset_36|, |v_#memory_$Pointer$.base_43|], 51=[|v_#memory_int_57|]} [2019-11-23 21:58:54,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:54,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:54,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2019-11-23 21:58:54,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:54,318 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:54,318 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:54,362 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 269 treesize of output 207 [2019-11-23 21:58:54,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,610 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-11-23 21:58:54,611 INFO L567 ElimStorePlain]: treesize reduction 192, result has 58.6 percent of original size [2019-11-23 21:58:54,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:54,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:54,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:54,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:54,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:54,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2019-11-23 21:58:54,625 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,687 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:338, output treesize:239 [2019-11-23 21:58:55,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:55,351 INFO L343 Elim1Store]: treesize reduction 8, result has 81.8 percent of original size [2019-11-23 21:58:55,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 199 treesize of output 134 [2019-11-23 21:58:55,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,356 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:58:55,458 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-23 21:58:55,459 INFO L567 ElimStorePlain]: treesize reduction 24, result has 83.8 percent of original size [2019-11-23 21:58:55,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:55,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 40 [2019-11-23 21:58:55,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:55,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:55,525 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:58:55,525 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:234, output treesize:79 [2019-11-23 21:58:55,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:55,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:55,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 43 [2019-11-23 21:58:55,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291810029] [2019-11-23 21:58:55,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-23 21:58:55,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:55,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-23 21:58:55,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1613, Unknown=0, NotChecked=0, Total=1806 [2019-11-23 21:58:55,698 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 43 states. [2019-11-23 21:58:56,615 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-11-23 21:58:57,049 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-11-23 21:58:57,303 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2019-11-23 21:58:57,687 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-11-23 21:58:57,894 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-11-23 21:58:58,280 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-11-23 21:58:58,654 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 101 [2019-11-23 21:58:59,152 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 132 [2019-11-23 21:58:59,377 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-11-23 21:59:00,472 WARN L192 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 182 [2019-11-23 21:59:01,714 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 250 DAG size of output: 232 [2019-11-23 21:59:02,989 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 252 DAG size of output: 234 [2019-11-23 21:59:04,311 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 254 DAG size of output: 236 [2019-11-23 21:59:05,236 WARN L192 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 236 [2019-11-23 21:59:06,162 WARN L192 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 238 [2019-11-23 21:59:07,163 WARN L192 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 240 [2019-11-23 21:59:08,136 WARN L192 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 192 [2019-11-23 21:59:09,082 WARN L192 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 194 [2019-11-23 21:59:10,107 WARN L192 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 196 [2019-11-23 21:59:10,885 WARN L192 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 163 [2019-11-23 21:59:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:10,970 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2019-11-23 21:59:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-23 21:59:10,971 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 49 [2019-11-23 21:59:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:10,972 INFO L225 Difference]: With dead ends: 88 [2019-11-23 21:59:10,972 INFO L226 Difference]: Without dead ends: 75 [2019-11-23 21:59:10,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=909, Invalid=3783, Unknown=0, NotChecked=0, Total=4692 [2019-11-23 21:59:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-23 21:59:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-11-23 21:59:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-23 21:59:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-11-23 21:59:10,993 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 49 [2019-11-23 21:59:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:10,993 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-11-23 21:59:10,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-23 21:59:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-11-23 21:59:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 21:59:10,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:10,994 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:11,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:11,195 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash 83257994, now seen corresponding path program 2 times [2019-11-23 21:59:11,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:11,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604219081] [2019-11-23 21:59:11,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:12,194 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-11-23 21:59:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:59:12,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604219081] [2019-11-23 21:59:12,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728200858] [2019-11-23 21:59:12,686 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:12,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:59:12,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:12,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 91 conjunts are in the unsatisfiable core [2019-11-23 21:59:12,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:12,789 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:59:12,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:12,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:12,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:12,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:12,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:12,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:12,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:12,917 INFO L567 ElimStorePlain]: treesize reduction 14, result has 61.1 percent of original size [2019-11-23 21:59:12,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:12,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2019-11-23 21:59:12,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:12,959 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 18 treesize of output 19 [2019-11-23 21:59:12,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:12,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:12,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:12,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:40 [2019-11-23 21:59:13,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,072 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:13,073 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 115 [2019-11-23 21:59:13,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:13,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:13,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:13,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:13,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-11-23 21:59:13,199 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-11-23 21:59:13,200 INFO L567 ElimStorePlain]: treesize reduction 522, result has 10.9 percent of original size [2019-11-23 21:59:13,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:13,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:64 [2019-11-23 21:59:13,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:13,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-23 21:59:13,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:13,413 INFO L567 ElimStorePlain]: treesize reduction 40, result has 64.9 percent of original size [2019-11-23 21:59:13,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:13,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:74 [2019-11-23 21:59:13,511 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_37|], 2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.base_45|], 4=[|v_#memory_$Pointer$.base_47|], 10=[|v_#memory_$Pointer$.base_52|]} [2019-11-23 21:59:13,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,522 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 18 treesize of output 19 [2019-11-23 21:59:13,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:13,631 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-23 21:59:13,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:13,635 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:59:13,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:13,711 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:59:13,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:13,771 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:59:13,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:13,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:13,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:14,054 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-23 21:59:14,054 INFO L343 Elim1Store]: treesize reduction 110, result has 64.5 percent of original size [2019-11-23 21:59:14,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 283 [2019-11-23 21:59:14,057 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:14,198 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-11-23 21:59:14,199 INFO L567 ElimStorePlain]: treesize reduction 244, result has 34.9 percent of original size [2019-11-23 21:59:14,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:14,200 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:163, output treesize:106 [2019-11-23 21:59:14,300 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_41|], 25=[|v_#memory_$Pointer$.base_53|]} [2019-11-23 21:59:14,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:14,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:14,307 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-11-23 21:59:14,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:14,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:14,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:14,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:14,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:14,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:14,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 158 treesize of output 210 [2019-11-23 21:59:14,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:14,533 INFO L567 ElimStorePlain]: treesize reduction 200, result has 44.6 percent of original size [2019-11-23 21:59:14,533 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:59:14,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:194, output treesize:161 [2019-11-23 21:59:14,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:14,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:14,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 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:59:14,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:14,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:14,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:14,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:143, output treesize:135 [2019-11-23 21:59:14,883 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_39|, |v_#memory_$Pointer$.offset_38|], 4=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_40|], 7=[|v_#memory_$Pointer$.offset_42|], 20=[|v_#memory_$Pointer$.base_54|]} [2019-11-23 21:59:14,906 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:59:15,121 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-23 21:59:15,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:15,127 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:59:15,291 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-23 21:59:15,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:15,297 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:59:15,448 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-23 21:59:15,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:15,452 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:59:15,584 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-23 21:59:15,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:15,588 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:59:15,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:15,688 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:59:15,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:15,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 78 [2019-11-23 21:59:15,796 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:15,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:15,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,895 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:15,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:15,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:16,266 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-23 21:59:16,267 INFO L343 Elim1Store]: treesize reduction 110, result has 72.5 percent of original size [2019-11-23 21:59:16,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 142 treesize of output 389 [2019-11-23 21:59:16,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:59:16,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:16,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:16,457 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:16,741 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 77 [2019-11-23 21:59:16,741 INFO L567 ElimStorePlain]: treesize reduction 306, result has 37.0 percent of original size [2019-11-23 21:59:16,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 8 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:16,743 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:277, output treesize:159 [2019-11-23 21:59:16,878 INFO L392 ElimStorePlain]: Different costs {21=[|v_#memory_$Pointer$.offset_43|], 40=[|v_#memory_$Pointer$.base_55|]} [2019-11-23 21:59:16,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:16,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:16,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:16,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:16,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2019-11-23 21:59:16,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:16,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:16,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:16,940 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:16,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:17,215 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-23 21:59:17,216 INFO L343 Elim1Store]: treesize reduction 14, result has 93.8 percent of original size [2019-11-23 21:59:17,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 23 case distinctions, treesize of input 233 treesize of output 300 [2019-11-23 21:59:17,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:17,370 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-11-23 21:59:17,371 INFO L567 ElimStorePlain]: treesize reduction 472, result has 32.9 percent of original size [2019-11-23 21:59:17,371 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:59:17,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:277, output treesize:231 [2019-11-23 21:59:17,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:17,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:17,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:17,961 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size