java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:24:13,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:24:13,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:24:13,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:24:13,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:24:13,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:24:13,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:24:13,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:24:13,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:24:13,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:24:13,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:24:13,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:24:13,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:24:13,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:24:13,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:24:13,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:24:13,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:24:13,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:24:13,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:24:13,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:24:13,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:24:13,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:24:13,760 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:24:13,761 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:24:13,762 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:24:13,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:24:13,764 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:24:13,764 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:24:13,765 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:24:13,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:24:13,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:24:13,766 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:24:13,776 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:24:13,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:24:13,777 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:24:13,777 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:24:13,777 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:24:13,777 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:24:13,778 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:24:13,778 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:24:13,778 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:24:13,779 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:24:13,779 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:24:13,779 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:24:13,779 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:24:13,779 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:24:13,780 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:24:13,780 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:24:13,780 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:24:13,780 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:24:13,780 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:24:13,781 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:24:13,781 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:24:13,781 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:24:13,781 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:24:13,781 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:24:13,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:24:13,782 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:24:13,782 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:24:13,782 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:24:13,782 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:24:13,783 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:24:13,783 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:24:13,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:24:13,783 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:24:13,783 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:24:13,784 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:24:13,785 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:24:13,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:24:13,832 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:24:13,836 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:24:13,837 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:24:13,838 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:24:13,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i [2018-01-24 17:24:14,036 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:24:14,042 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:24:14,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:24:14,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:24:14,049 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:24:14,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:24:14" (1/1) ... [2018-01-24 17:24:14,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7207b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14, skipping insertion in model container [2018-01-24 17:24:14,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:24:14" (1/1) ... [2018-01-24 17:24:14,067 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:24:14,116 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:24:14,226 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:24:14,243 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:24:14,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14 WrapperNode [2018-01-24 17:24:14,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:24:14,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:24:14,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:24:14,253 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:24:14,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14" (1/1) ... [2018-01-24 17:24:14,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14" (1/1) ... [2018-01-24 17:24:14,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14" (1/1) ... [2018-01-24 17:24:14,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14" (1/1) ... [2018-01-24 17:24:14,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14" (1/1) ... [2018-01-24 17:24:14,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14" (1/1) ... [2018-01-24 17:24:14,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14" (1/1) ... [2018-01-24 17:24:14,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:24:14,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:24:14,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:24:14,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:24:14,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14" (1/1) ... No working directory specified, using /storage/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 [2018-01-24 17:24:14,343 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:24:14,343 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:24:14,343 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:24:14,343 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-01-24 17:24:14,343 INFO L136 BoogieDeclarations]: Found implementation of procedure free_10 [2018-01-24 17:24:14,344 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:24:14,344 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:24:14,344 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:24:14,344 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:24:14,344 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:24:14,344 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:24:14,344 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:24:14,344 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:24:14,344 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:24:14,344 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:24:14,345 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:24:14,345 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-01-24 17:24:14,345 INFO L128 BoogieDeclarations]: Found specification of procedure free_10 [2018-01-24 17:24:14,345 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:24:14,345 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:24:14,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:24:14,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:24:14,691 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:24:14,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:24:14 BoogieIcfgContainer [2018-01-24 17:24:14,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:24:14,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:24:14,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:24:14,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:24:14,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:24:14" (1/3) ... [2018-01-24 17:24:14,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113e85d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:24:14, skipping insertion in model container [2018-01-24 17:24:14,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:14" (2/3) ... [2018-01-24 17:24:14,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113e85d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:24:14, skipping insertion in model container [2018-01-24 17:24:14,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:24:14" (3/3) ... [2018-01-24 17:24:14,700 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test10_true-valid-memsafety_true-termination.i [2018-01-24 17:24:14,709 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:24:14,718 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-01-24 17:24:14,770 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:24:14,770 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:24:14,770 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:24:14,770 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:24:14,770 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:24:14,771 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:24:14,771 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:24:14,771 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:24:14,772 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:24:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-24 17:24:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 17:24:14,802 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:14,804 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:14,804 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-24 17:24:14,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1784809794, now seen corresponding path program 1 times [2018-01-24 17:24:14,812 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:14,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:14,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:14,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:14,865 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:14,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:15,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:15,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:24:15,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:15,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:24:15,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:24:15,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:24:15,107 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2018-01-24 17:24:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:15,353 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2018-01-24 17:24:15,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:24:15,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-24 17:24:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:15,372 INFO L225 Difference]: With dead ends: 147 [2018-01-24 17:24:15,372 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 17:24:15,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:24:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 17:24:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2018-01-24 17:24:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 17:24:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-01-24 17:24:15,434 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 16 [2018-01-24 17:24:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:15,435 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-01-24 17:24:15,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:24:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-01-24 17:24:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 17:24:15,437 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:15,437 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:15,438 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-24 17:24:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1808064800, now seen corresponding path program 1 times [2018-01-24 17:24:15,438 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:15,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:15,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:15,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:15,441 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:15,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:15,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:15,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:24:15,540 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:15,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:24:15,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:24:15,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:24:15,542 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 6 states. [2018-01-24 17:24:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:15,699 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2018-01-24 17:24:15,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:24:15,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 17:24:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:15,701 INFO L225 Difference]: With dead ends: 150 [2018-01-24 17:24:15,701 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 17:24:15,702 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:24:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 17:24:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2018-01-24 17:24:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 17:24:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-24 17:24:15,714 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 18 [2018-01-24 17:24:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:15,714 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-24 17:24:15,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:24:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-24 17:24:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:24:15,715 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:15,715 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:15,715 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-24 17:24:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1556713239, now seen corresponding path program 1 times [2018-01-24 17:24:15,716 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:15,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:15,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:15,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:15,718 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:15,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:24:15,810 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:15,811 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:15,812 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-01-24 17:24:15,814 INFO L201 CegarAbsIntRunner]: [31], [37], [38], [39], [40], [45], [49], [52], [109], [111], [112], [113], [115], [116], [117], [118] [2018-01-24 17:24:15,860 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:24:15,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:24:15,961 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:24:15,962 INFO L268 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Never found a fixpoint. Largest state had 12 variables. [2018-01-24 17:24:15,968 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:24:16,026 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 66.53% of their original sizes. [2018-01-24 17:24:16,026 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:24:16,049 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:24:16,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:24:16,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-01-24 17:24:16,050 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:16,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:24:16,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:24:16,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:24:16,051 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-01-24 17:24:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:17,352 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2018-01-24 17:24:17,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:24:17,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 17:24:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:17,353 INFO L225 Difference]: With dead ends: 185 [2018-01-24 17:24:17,353 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 17:24:17,354 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:24:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 17:24:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-24 17:24:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 17:24:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-01-24 17:24:17,362 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 19 [2018-01-24 17:24:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:17,362 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-01-24 17:24:17,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:24:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-01-24 17:24:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 17:24:17,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:17,363 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:17,364 INFO L371 AbstractCegarLoop]: === Iteration 4 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-24 17:24:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash 256564149, now seen corresponding path program 1 times [2018-01-24 17:24:17,364 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:17,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:17,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:17,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:17,366 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:17,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:17,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:17,434 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:17,434 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-24 17:24:17,434 INFO L201 CegarAbsIntRunner]: [31], [34], [35], [36], [37], [38], [39], [40], [45], [49], [52], [109], [111], [112], [113], [115], [116], [117], [118] [2018-01-24 17:24:17,435 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:24:17,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:24:17,501 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:24:17,501 INFO L268 AbstractInterpreter]: Visited 19 different actions 32 times. Merged at 5 different actions 7 times. Never widened. Never found a fixpoint. Largest state had 15 variables. [2018-01-24 17:24:17,517 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:24:17,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:17,518 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:24:17,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:17,529 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:17,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:17,616 INFO L477 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 [2018-01-24 17:24:17,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:17,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:17,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:24:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:17,653 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:17,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:17,783 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:24:17,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:17,790 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:17,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:17,835 INFO L477 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 [2018-01-24 17:24:17,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:17,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:17,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:24:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:17,876 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:17,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:24:17,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 7 [2018-01-24 17:24:17,965 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:24:17,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:24:17,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:24:17,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:24:17,966 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 7 states. [2018-01-24 17:24:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:18,185 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-01-24 17:24:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:24:18,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-24 17:24:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:18,187 INFO L225 Difference]: With dead ends: 120 [2018-01-24 17:24:18,187 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 17:24:18,187 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 13 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:24:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 17:24:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-01-24 17:24:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-24 17:24:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-01-24 17:24:18,199 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 21 [2018-01-24 17:24:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:18,200 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-01-24 17:24:18,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:24:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-01-24 17:24:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 17:24:18,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:18,201 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:18,201 INFO L371 AbstractCegarLoop]: === Iteration 5 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-24 17:24:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash 256564150, now seen corresponding path program 1 times [2018-01-24 17:24:18,201 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:18,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:18,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:18,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:18,203 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:18,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:18,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:18,426 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:18,426 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-24 17:24:18,427 INFO L201 CegarAbsIntRunner]: [31], [34], [35], [36], [37], [38], [39], [40], [45], [49], [53], [109], [111], [112], [113], [115], [116], [117], [118] [2018-01-24 17:24:18,428 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:24:18,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:24:18,515 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:24:18,515 INFO L268 AbstractInterpreter]: Visited 19 different actions 32 times. Merged at 6 different actions 8 times. Never widened. Never found a fixpoint. Largest state had 15 variables. [2018-01-24 17:24:18,517 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:24:18,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:18,517 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:24:18,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:18,524 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:18,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:18,558 INFO L477 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 17 treesize of output 16 [2018-01-24 17:24:18,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:18,571 INFO L477 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 20 treesize of output 19 [2018-01-24 17:24:18,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:18,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:18,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:24:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:18,654 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:18,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:18,860 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:24:18,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:18,864 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:18,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:18,900 INFO L477 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 20 treesize of output 19 [2018-01-24 17:24:18,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:18,917 INFO L477 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 17 treesize of output 16 [2018-01-24 17:24:18,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:18,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:18,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:24:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:18,991 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:19,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:24:19,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 18 [2018-01-24 17:24:19,134 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:24:19,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:24:19,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:24:19,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=290, Unknown=1, NotChecked=0, Total=342 [2018-01-24 17:24:19,135 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 13 states. [2018-01-24 17:24:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:19,571 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2018-01-24 17:24:19,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:24:19,572 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-01-24 17:24:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:19,573 INFO L225 Difference]: With dead ends: 151 [2018-01-24 17:24:19,573 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 17:24:19,574 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=383, Unknown=1, NotChecked=0, Total=462 [2018-01-24 17:24:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 17:24:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-01-24 17:24:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-24 17:24:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2018-01-24 17:24:19,589 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 21 [2018-01-24 17:24:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:19,589 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2018-01-24 17:24:19,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:24:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2018-01-24 17:24:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:24:19,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:19,590 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:19,590 INFO L371 AbstractCegarLoop]: === Iteration 6 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-24 17:24:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1653900695, now seen corresponding path program 1 times [2018-01-24 17:24:19,590 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:19,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:19,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:19,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:19,592 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:19,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:19,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:19,717 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:19,717 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 17:24:19,717 INFO L201 CegarAbsIntRunner]: [31], [34], [35], [36], [38], [39], [40], [45], [49], [52], [109], [111], [112], [113], [115], [116], [117], [118] [2018-01-24 17:24:19,718 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:24:19,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:24:19,745 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:24:19,746 INFO L268 AbstractInterpreter]: Visited 18 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 15 variables. [2018-01-24 17:24:19,747 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:24:19,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:19,747 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:24:19,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:19,762 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:19,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:19,796 INFO L477 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 [2018-01-24 17:24:19,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:19,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:19,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:24:19,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:19,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:19,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 17:24:19,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:19,832 INFO L267 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. [2018-01-24 17:24:19,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 17:24:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:19,844 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:20,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:20,041 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:24:20,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:20,045 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:20,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:20,077 INFO L477 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 [2018-01-24 17:24:20,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:20,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:20,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:24:20,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:20,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:20,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 17:24:20,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:20,124 INFO L267 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. [2018-01-24 17:24:20,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 17:24:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:20,125 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:21,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:24:21,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 16 [2018-01-24 17:24:21,549 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:24:21,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:24:21,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:24:21,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:24:21,550 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand 11 states. [2018-01-24 17:24:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:22,006 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2018-01-24 17:24:22,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:24:22,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-01-24 17:24:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:22,009 INFO L225 Difference]: With dead ends: 141 [2018-01-24 17:24:22,009 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 17:24:22,009 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:24:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 17:24:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 122. [2018-01-24 17:24:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-24 17:24:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2018-01-24 17:24:22,023 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 23 [2018-01-24 17:24:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:22,023 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2018-01-24 17:24:22,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:24:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2018-01-24 17:24:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:24:22,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:22,024 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:22,024 INFO L371 AbstractCegarLoop]: === Iteration 7 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-24 17:24:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1653900696, now seen corresponding path program 1 times [2018-01-24 17:24:22,025 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:22,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:22,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:22,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:22,026 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:22,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:22,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:22,287 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:22,287 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 17:24:22,288 INFO L201 CegarAbsIntRunner]: [31], [34], [35], [36], [38], [39], [40], [45], [49], [53], [109], [111], [112], [113], [115], [116], [117], [118] [2018-01-24 17:24:22,289 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:24:22,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:24:22,324 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:24:22,325 INFO L268 AbstractInterpreter]: Visited 18 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 15 variables. [2018-01-24 17:24:22,326 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:24:22,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:22,326 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:24:22,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:22,340 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:22,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:22,394 INFO L477 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 26 treesize of output 25 [2018-01-24 17:24:22,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:22,415 INFO L477 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 23 treesize of output 22 [2018-01-24 17:24:22,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:22,417 INFO L477 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 25 treesize of output 24 [2018-01-24 17:24:22,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:22,435 INFO L477 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 22 treesize of output 21 [2018-01-24 17:24:22,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:22,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:22,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:24:22,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:22,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-01-24 17:24:22,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:22,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:22,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:22,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 17:24:22,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:22,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:24:22,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-01-24 17:24:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:22,675 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:22,776 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 17:24:26,945 WARN L146 SmtUtils]: Spent 4094ms on a formula simplification. DAG size of input: 61 DAG size of output 25 [2018-01-24 17:24:26,956 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-01-24 17:24:28,022 WARN L146 SmtUtils]: Spent 1010ms on a formula simplification. DAG size of input: 63 DAG size of output 61 [2018-01-24 17:24:28,028 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-01-24 17:24:28,037 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-01-24 17:24:29,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 18 [2018-01-24 17:24:29,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,037 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-24 17:24:29,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 5 [2018-01-24 17:24:29,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-01-24 17:24:29,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:29,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:68, output treesize:21 [2018-01-24 17:24:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:29,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:29,154 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:24:29,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:29,158 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:29,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:29,195 INFO L477 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 23 treesize of output 22 [2018-01-24 17:24:29,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,212 INFO L477 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 26 treesize of output 25 [2018-01-24 17:24:29,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,214 INFO L477 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 22 treesize of output 21 [2018-01-24 17:24:29,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,231 INFO L477 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 25 treesize of output 24 [2018-01-24 17:24:29,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:29,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:24:29,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:29,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:29,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-24 17:24:29,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 26 treesize of output 25 [2018-01-24 17:24:29,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:29,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:29,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 34 treesize of output 47 [2018-01-24 17:24:29,346 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:29,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:24:29,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-24 17:24:29,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:29,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 17:24:29,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-01-24 17:24:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:29,448 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:29,574 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 17:24:30,057 WARN L146 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 76 DAG size of output 28 [2018-01-24 17:24:30,067 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:24:32,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 18 [2018-01-24 17:24:32,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:32,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 36 treesize of output 30 [2018-01-24 17:24:32,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:32,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-01-24 17:24:32,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 5 [2018-01-24 17:24:32,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:32,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:24:32,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:32,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:21 [2018-01-24 17:24:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:32,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:24:32,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 9, 9] total 35 [2018-01-24 17:24:32,876 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:24:32,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 17:24:32,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 17:24:32,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1129, Unknown=3, NotChecked=0, Total=1260 [2018-01-24 17:24:32,877 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand 19 states. [2018-01-24 17:24:33,220 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 64 DAG size of output 48 [2018-01-24 17:24:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:36,961 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2018-01-24 17:24:36,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:24:36,962 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-01-24 17:24:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:36,963 INFO L225 Difference]: With dead ends: 169 [2018-01-24 17:24:36,963 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 17:24:36,965 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=206, Invalid=1596, Unknown=4, NotChecked=0, Total=1806 [2018-01-24 17:24:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 17:24:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 88. [2018-01-24 17:24:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 17:24:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-24 17:24:36,974 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 23 [2018-01-24 17:24:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:36,974 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-24 17:24:36,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 17:24:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-24 17:24:36,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:24:36,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:36,976 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:36,976 INFO L371 AbstractCegarLoop]: === Iteration 8 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-01-24 17:24:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1058360171, now seen corresponding path program 1 times [2018-01-24 17:24:36,976 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:36,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:36,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:36,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:36,978 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:36,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:24:37,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:37,183 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:37,183 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 17:24:37,183 INFO L201 CegarAbsIntRunner]: [15], [31], [34], [35], [36], [37], [38], [39], [40], [45], [49], [51], [54], [55], [60], [103], [106], [109], [110], [111], [112], [113], [115], [116], [117], [118] [2018-01-24 17:24:37,184 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:24:37,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:24:37,265 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:24:37,274 INFO L268 AbstractInterpreter]: Visited 26 different actions 42 times. Merged at 8 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-24 17:24:37,277 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:24:37,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:37,277 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:24:37,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:37,287 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:37,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 17:24:37,550 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:37,659 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_16| term size 19 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) 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:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 17:24:37,662 INFO L168 Benchmark]: Toolchain (without parser) took 23625.70 ms. Allocated memory was 307.2 MB in the beginning and 572.5 MB in the end (delta: 265.3 MB). Free memory was 266.1 MB in the beginning and 488.3 MB in the end (delta: -222.1 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-01-24 17:24:37,663 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:24:37,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.06 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 252.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:24:37,663 INFO L168 Benchmark]: Boogie Preprocessor took 37.08 ms. Allocated memory is still 307.2 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:24:37,664 INFO L168 Benchmark]: RCFGBuilder took 401.63 ms. Allocated memory is still 307.2 MB. Free memory was 250.1 MB in the beginning and 225.2 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:24:37,664 INFO L168 Benchmark]: TraceAbstraction took 22968.56 ms. Allocated memory was 307.2 MB in the beginning and 572.5 MB in the end (delta: 265.3 MB). Free memory was 223.2 MB in the beginning and 488.3 MB in the end (delta: -265.1 MB). Peak memory consumption was 200.2 kB. Max. memory is 5.3 GB. [2018-01-24 17:24:37,666 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.06 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 252.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.08 ms. Allocated memory is still 307.2 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 401.63 ms. Allocated memory is still 307.2 MB. Free memory was 250.1 MB in the beginning and 225.2 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22968.56 ms. Allocated memory was 307.2 MB in the beginning and 572.5 MB in the end (delta: 265.3 MB). Free memory was 223.2 MB in the beginning and 488.3 MB in the end (delta: -265.1 MB). Peak memory consumption was 200.2 kB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 12 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 57 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -24 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 21 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 24 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.485370 RENAME_VARIABLES(MILLISECONDS) : 0.105216 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.170919 PROJECTAWAY(MILLISECONDS) : 0.021306 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.014825 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.132783 ADD_EQUALITY(MILLISECONDS) : 0.045872 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013048 #CONJOIN_DISJUNCTIVE : 20 #RENAME_VARIABLES : 41 #UNFREEZE : 0 #CONJOIN : 42 #PROJECTAWAY : 42 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 40 #ADD_EQUALITY : 24 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 76 LocStat_NO_SUPPORTING_DISEQUALITIES : 11 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 39 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.217615 RENAME_VARIABLES(MILLISECONDS) : 0.065058 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.191881 PROJECTAWAY(MILLISECONDS) : 0.050804 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001420 DISJOIN(MILLISECONDS) : 0.350835 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.085503 ADD_EQUALITY(MILLISECONDS) : 0.019454 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.033089 #CONJOIN_DISJUNCTIVE : 55 #RENAME_VARIABLES : 112 #UNFREEZE : 0 #CONJOIN : 104 #PROJECTAWAY : 92 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 109 #ADD_EQUALITY : 39 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 75 LocStat_NO_SUPPORTING_DISEQUALITIES : 9 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.386905 RENAME_VARIABLES(MILLISECONDS) : 0.109854 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.173948 PROJECTAWAY(MILLISECONDS) : 0.050219 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001129 DISJOIN(MILLISECONDS) : 0.437662 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.133286 ADD_EQUALITY(MILLISECONDS) : 0.023905 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010861 #CONJOIN_DISJUNCTIVE : 55 #RENAME_VARIABLES : 115 #UNFREEZE : 0 #CONJOIN : 107 #PROJECTAWAY : 98 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 109 #ADD_EQUALITY : 41 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 89 LocStat_NO_SUPPORTING_DISEQUALITIES : 16 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.352927 RENAME_VARIABLES(MILLISECONDS) : 0.066593 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.312902 PROJECTAWAY(MILLISECONDS) : 0.047587 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000861 DISJOIN(MILLISECONDS) : 0.159581 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.089077 ADD_EQUALITY(MILLISECONDS) : 0.016416 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.030403 #CONJOIN_DISJUNCTIVE : 38 #RENAME_VARIABLES : 66 #UNFREEZE : 0 #CONJOIN : 68 #PROJECTAWAY : 63 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 65 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 89 LocStat_NO_SUPPORTING_DISEQUALITIES : 15 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.516127 RENAME_VARIABLES(MILLISECONDS) : 0.077216 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.202522 PROJECTAWAY(MILLISECONDS) : 0.036290 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001186 DISJOIN(MILLISECONDS) : 0.232859 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.097612 ADD_EQUALITY(MILLISECONDS) : 0.018971 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010180 #CONJOIN_DISJUNCTIVE : 38 #RENAME_VARIABLES : 67 #UNFREEZE : 0 #CONJOIN : 69 #PROJECTAWAY : 65 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 65 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 116 LocStat_NO_SUPPORTING_DISEQUALITIES : 17 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.083543 RENAME_VARIABLES(MILLISECONDS) : 0.047963 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.055946 PROJECTAWAY(MILLISECONDS) : 0.023104 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001973 DISJOIN(MILLISECONDS) : 0.359845 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.067264 ADD_EQUALITY(MILLISECONDS) : 0.014358 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015783 #CONJOIN_DISJUNCTIVE : 72 #RENAME_VARIABLES : 144 #UNFREEZE : 0 #CONJOIN : 167 #PROJECTAWAY : 120 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 138 #ADD_EQUALITY : 63 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_16| term size 19 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_16| term size 19: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_17-24-37-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_17-24-37-680.csv Received shutdown request...