/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/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/tree-3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:39:38,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:39:38,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:39:38,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:39:38,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:39:38,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:39:38,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:39:38,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:39:38,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:39:38,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:39:38,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:39:38,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:39:38,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:39:38,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:39:38,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:39:38,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:39:38,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:39:38,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:39:38,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:39:38,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:39:38,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:39:38,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:39:38,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:39:38,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:39:38,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:39:38,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:39:38,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:39:38,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:39:38,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:39:38,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:39:38,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:39:38,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:39:38,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:39:38,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:39:38,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:39:38,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:39:38,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:39:38,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:39:38,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:39:38,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:39:38,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:39:38,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 00:39:38,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:39:38,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:39:38,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:39:38,146 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:39:38,147 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:39:38,147 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:39:38,147 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:39:38,147 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:39:38,147 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:39:38,147 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:39:38,148 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:39:38,148 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:39:38,148 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:39:38,148 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:39:38,148 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:39:38,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:39:38,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:39:38,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:39:38,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:39:38,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:39:38,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:39:38,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:39:38,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:39:38,152 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:39:38,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:39:38,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:39:38,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:39:38,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:39:38,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:39:38,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:39:38,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:39:38,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:39:38,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:39:38,155 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:39:38,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:39:38,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:39:38,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:39:38,156 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:39:38,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:39:38,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:39:38,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:39:38,430 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:39:38,431 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:39:38,432 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/tree-3.i [2019-11-24 00:39:38,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10594ea7/69d0deb878874f7c8056b98b92f34647/FLAG087fdd0ac [2019-11-24 00:39:39,003 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:39:39,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/tree-3.i [2019-11-24 00:39:39,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10594ea7/69d0deb878874f7c8056b98b92f34647/FLAG087fdd0ac [2019-11-24 00:39:39,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10594ea7/69d0deb878874f7c8056b98b92f34647 [2019-11-24 00:39:39,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:39:39,320 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:39:39,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:39:39,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:39:39,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:39:39,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:39,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af51c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39, skipping insertion in model container [2019-11-24 00:39:39,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:39,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:39:39,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:39:39,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:39:39,821 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:39:39,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:39:39,917 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:39:39,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39 WrapperNode [2019-11-24 00:39:39,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:39:39,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:39:39,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:39:39,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:39:39,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:39,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:39,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:39:39,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:39:39,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:39:39,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:39:39,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:39,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:39,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:39,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:40,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:40,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:40,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (1/1) ... [2019-11-24 00:39:40,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:39:40,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:39:40,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:39:40,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:39:40,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (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-24 00:39:40,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:39:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:39:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:39:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:39:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:39:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:39:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:39:40,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:39:40,874 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:39:40,875 INFO L284 CfgBuilder]: Removed 27 assume(true) statements. [2019-11-24 00:39:40,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:39:40 BoogieIcfgContainer [2019-11-24 00:39:40,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:39:40,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:39:40,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:39:40,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:39:40,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:39:39" (1/3) ... [2019-11-24 00:39:40,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e49270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:39:40, skipping insertion in model container [2019-11-24 00:39:40,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:39" (2/3) ... [2019-11-24 00:39:40,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e49270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:39:40, skipping insertion in model container [2019-11-24 00:39:40,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:39:40" (3/3) ... [2019-11-24 00:39:40,884 INFO L109 eAbstractionObserver]: Analyzing ICFG tree-3.i [2019-11-24 00:39:40,893 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:39:40,901 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-24 00:39:40,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-24 00:39:40,937 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:39:40,937 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:39:40,938 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:39:40,938 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:39:40,938 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:39:40,938 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:39:40,938 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:39:40,939 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:39:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-24 00:39:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 00:39:40,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:40,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:40,962 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:40,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:40,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1697524703, now seen corresponding path program 1 times [2019-11-24 00:39:40,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:40,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678344730] [2019-11-24 00:39:40,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:41,082 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-24 00:39:41,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678344730] [2019-11-24 00:39:41,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:41,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:39:41,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037987286] [2019-11-24 00:39:41,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:39:41,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:41,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:39:41,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:39:41,106 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-11-24 00:39:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:41,126 INFO L93 Difference]: Finished difference Result 53 states and 85 transitions. [2019-11-24 00:39:41,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:39:41,128 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-11-24 00:39:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:41,138 INFO L225 Difference]: With dead ends: 53 [2019-11-24 00:39:41,138 INFO L226 Difference]: Without dead ends: 23 [2019-11-24 00:39:41,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:39:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-24 00:39:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-24 00:39:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-24 00:39:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-24 00:39:41,178 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2019-11-24 00:39:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:41,179 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-24 00:39:41,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:39:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-11-24 00:39:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 00:39:41,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:41,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:41,180 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:41,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:41,181 INFO L82 PathProgramCache]: Analyzing trace with hash 340775895, now seen corresponding path program 1 times [2019-11-24 00:39:41,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:41,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384004113] [2019-11-24 00:39:41,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:41,287 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-24 00:39:41,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384004113] [2019-11-24 00:39:41,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:41,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:39:41,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869512636] [2019-11-24 00:39:41,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:39:41,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:39:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:41,291 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-11-24 00:39:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:41,437 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-24 00:39:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:39:41,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-24 00:39:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:41,438 INFO L225 Difference]: With dead ends: 36 [2019-11-24 00:39:41,438 INFO L226 Difference]: Without dead ends: 34 [2019-11-24 00:39:41,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:39:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-24 00:39:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2019-11-24 00:39:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-24 00:39:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-24 00:39:41,445 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 8 [2019-11-24 00:39:41,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:41,445 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-24 00:39:41,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:39:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-24 00:39:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 00:39:41,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:41,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:41,447 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash 318866445, now seen corresponding path program 1 times [2019-11-24 00:39:41,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:41,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227134417] [2019-11-24 00:39:41,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:41,545 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-24 00:39:41,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227134417] [2019-11-24 00:39:41,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:41,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:39:41,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700254304] [2019-11-24 00:39:41,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:39:41,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:41,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:39:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:39:41,549 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 4 states. [2019-11-24 00:39:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:41,633 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-11-24 00:39:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:39:41,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-24 00:39:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:41,635 INFO L225 Difference]: With dead ends: 41 [2019-11-24 00:39:41,635 INFO L226 Difference]: Without dead ends: 23 [2019-11-24 00:39:41,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:39:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-24 00:39:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-24 00:39:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-24 00:39:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-24 00:39:41,645 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2019-11-24 00:39:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:41,645 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-24 00:39:41,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:39:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-11-24 00:39:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 00:39:41,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:41,648 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:41,648 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:41,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1922003130, now seen corresponding path program 1 times [2019-11-24 00:39:41,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:41,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353990129] [2019-11-24 00:39:41,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:41,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353990129] [2019-11-24 00:39:41,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:39:41,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:39:41,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36902900] [2019-11-24 00:39:41,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:39:41,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:39:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:39:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:39:41,769 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-11-24 00:39:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:39:41,837 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-11-24 00:39:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:39:41,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 00:39:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:39:41,840 INFO L225 Difference]: With dead ends: 40 [2019-11-24 00:39:41,840 INFO L226 Difference]: Without dead ends: 24 [2019-11-24 00:39:41,841 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-24 00:39:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-24 00:39:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-24 00:39:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-24 00:39:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-11-24 00:39:41,851 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2019-11-24 00:39:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:39:41,852 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-24 00:39:41,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:39:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-11-24 00:39:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 00:39:41,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:39:41,853 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:39:41,854 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:39:41,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:39:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1950160569, now seen corresponding path program 1 times [2019-11-24 00:39:41,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:39:41,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811449793] [2019-11-24 00:39:41,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:39:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:39:42,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811449793] [2019-11-24 00:39:42,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709686515] [2019-11-24 00:39:42,146 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-24 00:39:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:39:42,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-24 00:39:42,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:39:42,320 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-24 00:39:42,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:39:42,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:39:42,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:39:42,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-24 00:39:42,444 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:39:42,445 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-24 00:39:42,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:39:42,683 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-24 00:39:42,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:39:42,696 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_62|], 6=[|v_#memory_$Pointer$.offset_70|, |v_#memory_$Pointer$.base_70|], 13=[|v_#memory_$Pointer$.offset_71|, |v_#memory_$Pointer$.base_71|]} [2019-11-24 00:39:42,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:39:42,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:39:42,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 935 treesize of output 301 [2019-11-24 00:39:42,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:39:42,860 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-24 00:39:42,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:39:42,874 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-24 00:39:42,986 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-24 00:39:42,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:39:43,018 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-24 00:39:43,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:39:43,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:39:43,758 WARN L192 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2019-11-24 00:39:43,759 INFO L343 Elim1Store]: treesize reduction 2440, result has 70.4 percent of original size [2019-11-24 00:39:43,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 8128 treesize of output 11304 [2019-11-24 00:39:43,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:43,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:43,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:39:44,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:39:44,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:39:44,105 INFO L392 ElimStorePlain]: Different costs {6=[v_arrayElimArr_1], 12=[v_arrayElimArr_2]} [2019-11-24 00:39:44,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:39:44,313 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-24 00:39:44,318 INFO L168 Benchmark]: Toolchain (without parser) took 4997.33 ms. Allocated memory was 139.5 MB in the beginning and 248.0 MB in the end (delta: 108.5 MB). Free memory was 102.5 MB in the beginning and 193.6 MB in the end (delta: -91.2 MB). Peak memory consumption was 120.6 MB. Max. memory is 7.1 GB. [2019-11-24 00:39:44,319 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 139.5 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 00:39:44,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.95 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 169.3 MB in the end (delta: -67.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-11-24 00:39:44,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.99 ms. Allocated memory is still 203.4 MB. Free memory was 169.3 MB in the beginning and 166.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-24 00:39:44,321 INFO L168 Benchmark]: Boogie Preprocessor took 59.14 ms. Allocated memory is still 203.4 MB. Free memory was 166.7 MB in the beginning and 164.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-24 00:39:44,322 INFO L168 Benchmark]: RCFGBuilder took 847.94 ms. Allocated memory is still 203.4 MB. Free memory was 164.7 MB in the beginning and 111.2 MB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. [2019-11-24 00:39:44,323 INFO L168 Benchmark]: TraceAbstraction took 3438.81 ms. Allocated memory was 203.4 MB in the beginning and 248.0 MB in the end (delta: 44.6 MB). Free memory was 110.6 MB in the beginning and 193.6 MB in the end (delta: -83.0 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB. [2019-11-24 00:39:44,327 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 139.5 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 596.95 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 169.3 MB in the end (delta: -67.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.99 ms. Allocated memory is still 203.4 MB. Free memory was 169.3 MB in the beginning and 166.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.14 ms. Allocated memory is still 203.4 MB. Free memory was 166.7 MB in the beginning and 164.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.94 ms. Allocated memory is still 203.4 MB. Free memory was 164.7 MB in the beginning and 111.2 MB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3438.81 ms. Allocated memory was 203.4 MB in the beginning and 248.0 MB in the end (delta: 44.6 MB). Free memory was 110.6 MB in the beginning and 193.6 MB in the end (delta: -83.0 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...