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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:07:00,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:07:00,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:07:00,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:07:00,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:07:00,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:07:00,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:07:00,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:07:00,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:07:00,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:07:00,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:07:00,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:07:00,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:07:00,394 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:07:00,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:07:00,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:07:00,400 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:07:00,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:07:00,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:07:00,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:07:00,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:07:00,407 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:07:00,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:07:00,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:07:00,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:07:00,410 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:07:00,410 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:07:00,411 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:07:00,411 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:07:00,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:07:00,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:07:00,412 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:07:00,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:07:00,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:07:00,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:07:00,422 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:07:00,422 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:07:00,422 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:07:00,422 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:07:00,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:07:00,423 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:07:00,423 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:07:00,423 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:07:00,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:07:00,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:07:00,424 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:07:00,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:07:00,424 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:07:00,424 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:07:00,424 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:07:00,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:07:00,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:07:00,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:07:00,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:07:00,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:07:00,425 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:07:00,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:07:00,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:07:00,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:07:00,426 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:07:00,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:07:00,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:07:00,426 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:07:00,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:07:00,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:07:00,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:07:00,426 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:07:00,427 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:07:00,427 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:07:00,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:07:00,472 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:07:00,476 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:07:00,477 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:07:00,477 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:07:00,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-01-20 22:07:00,656 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:07:00,661 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:07:00,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:07:00,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:07:00,701 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:07:00,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:07:00" (1/1) ... [2018-01-20 22:07:00,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585c73c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00, skipping insertion in model container [2018-01-20 22:07:00,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:07:00" (1/1) ... [2018-01-20 22:07:00,718 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:07:00,755 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:07:00,874 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:07:00,897 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:07:00,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00 WrapperNode [2018-01-20 22:07:00,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:07:00,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:07:00,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:07:00,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:07:00,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00" (1/1) ... [2018-01-20 22:07:00,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00" (1/1) ... [2018-01-20 22:07:00,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00" (1/1) ... [2018-01-20 22:07:00,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00" (1/1) ... [2018-01-20 22:07:00,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00" (1/1) ... [2018-01-20 22:07:00,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00" (1/1) ... [2018-01-20 22:07:00,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00" (1/1) ... [2018-01-20 22:07:00,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:07:00,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:07:00,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:07:00,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:07:00,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00" (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-20 22:07:00,992 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:07:00,992 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:07:00,992 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-20 22:07:00,992 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:07:00,992 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:07:00,992 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:07:00,992 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:07:00,992 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:07:00,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:07:01,326 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:07:01,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:07:01 BoogieIcfgContainer [2018-01-20 22:07:01,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:07:01,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:07:01,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:07:01,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:07:01,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:07:00" (1/3) ... [2018-01-20 22:07:01,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6117d527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:07:01, skipping insertion in model container [2018-01-20 22:07:01,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:00" (2/3) ... [2018-01-20 22:07:01,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6117d527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:07:01, skipping insertion in model container [2018-01-20 22:07:01,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:07:01" (3/3) ... [2018-01-20 22:07:01,332 INFO L105 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-01-20 22:07:01,338 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:07:01,345 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 22:07:01,393 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:01,394 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:01,394 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:01,394 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:01,394 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:01,394 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:01,394 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:01,395 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:07:01,395 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-20 22:07:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:07:01,420 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:01,421 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:07:01,421 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:07:01,425 INFO L82 PathProgramCache]: Analyzing trace with hash 159493, now seen corresponding path program 1 times [2018-01-20 22:07:01,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:01,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:01,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:01,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:01,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:01,520 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:07:01,526 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:07:01,533 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:01,533 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:01,533 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:01,533 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:01,534 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:01,534 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:01,534 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:01,534 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:07:01,534 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-20 22:07:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 22:07:01,541 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:01,541 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:07:01,541 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1690254578, now seen corresponding path program 1 times [2018-01-20 22:07:01,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:01,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:01,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:01,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:01,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:01,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:01,724 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-20 22:07:01,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:01,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:07:01,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:07:01,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:07:01,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:07:01,746 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-01-20 22:07:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:01,776 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-20 22:07:01,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:07:01,777 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2018-01-20 22:07:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:01,785 INFO L225 Difference]: With dead ends: 141 [2018-01-20 22:07:01,785 INFO L226 Difference]: Without dead ends: 76 [2018-01-20 22:07:01,788 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:07:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-20 22:07:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-20 22:07:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-20 22:07:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-20 22:07:01,822 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 34 [2018-01-20 22:07:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:01,822 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-20 22:07:01,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:07:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-20 22:07:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-20 22:07:01,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:01,825 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:07:01,825 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash -767510167, now seen corresponding path program 1 times [2018-01-20 22:07:01,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:01,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:01,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:01,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:01,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:01,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:01,922 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-20 22:07:01,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:01,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:01,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:01,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:01,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:01,926 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 3 states. [2018-01-20 22:07:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:01,948 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2018-01-20 22:07:01,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:01,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-20 22:07:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:01,949 INFO L225 Difference]: With dead ends: 139 [2018-01-20 22:07:01,950 INFO L226 Difference]: Without dead ends: 77 [2018-01-20 22:07:01,951 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-20 22:07:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-20 22:07:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-20 22:07:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-20 22:07:01,957 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 54 [2018-01-20 22:07:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:01,957 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-20 22:07:01,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-20 22:07:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-20 22:07:01,959 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:01,959 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:07:01,959 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:01,959 INFO L82 PathProgramCache]: Analyzing trace with hash 667417900, now seen corresponding path program 1 times [2018-01-20 22:07:01,959 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:01,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:01,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:01,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:01,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:01,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:02,064 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-20 22:07:02,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:02,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:02,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:02,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:02,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:02,065 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 3 states. [2018-01-20 22:07:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:02,101 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2018-01-20 22:07:02,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:02,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-01-20 22:07:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:02,103 INFO L225 Difference]: With dead ends: 117 [2018-01-20 22:07:02,103 INFO L226 Difference]: Without dead ends: 88 [2018-01-20 22:07:02,104 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-20 22:07:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-01-20 22:07:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-20 22:07:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-20 22:07:02,114 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 56 [2018-01-20 22:07:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:02,114 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-20 22:07:02,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-20 22:07:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-20 22:07:02,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:02,118 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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-20 22:07:02,118 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:02,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1090926838, now seen corresponding path program 1 times [2018-01-20 22:07:02,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:02,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:02,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:02,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:02,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:07:02,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:02,235 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 22:07:02,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:02,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:02,356 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc0.base| Int)) (and (<= (select |c_old(#valid)| |append_#t~malloc0.base|) 0) (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc0.base| 1)))) is different from true [2018-01-20 22:07:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:07:02,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:07:02,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 22:07:02,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:07:02,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:07:02,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-20 22:07:02,446 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 5 states. [2018-01-20 22:07:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:02,499 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2018-01-20 22:07:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:07:02,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-01-20 22:07:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:02,500 INFO L225 Difference]: With dead ends: 108 [2018-01-20 22:07:02,500 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:07:02,501 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-20 22:07:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:07:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:07:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:07:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:07:02,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-01-20 22:07:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:02,502 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:07:02,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:07:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:07:02,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:07:02,506 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:02,506 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:02,506 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:02,507 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:02,507 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:02,507 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:02,507 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:02,507 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:07:02,507 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-20 22:07:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 22:07:02,511 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:02,511 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:07:02,511 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:07:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash -315559237, now seen corresponding path program 1 times [2018-01-20 22:07:02,512 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:02,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:02,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:02,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:02,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:02,545 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-20 22:07:02,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:02,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:07:02,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:07:02,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:07:02,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:07:02,546 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-01-20 22:07:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:02,551 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-20 22:07:02,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:07:02,551 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-01-20 22:07:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:02,552 INFO L225 Difference]: With dead ends: 141 [2018-01-20 22:07:02,552 INFO L226 Difference]: Without dead ends: 74 [2018-01-20 22:07:02,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:07:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-20 22:07:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-20 22:07:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-20 22:07:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-20 22:07:02,557 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 32 [2018-01-20 22:07:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:02,558 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-20 22:07:02,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:07:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-20 22:07:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-20 22:07:02,559 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:02,559 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:07:02,559 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:07:02,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2131042546, now seen corresponding path program 1 times [2018-01-20 22:07:02,559 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:02,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:02,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:02,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:02,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:02,597 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-20 22:07:02,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:02,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:02,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:02,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:02,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:02,598 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 3 states. [2018-01-20 22:07:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:02,618 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2018-01-20 22:07:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:02,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-01-20 22:07:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:02,619 INFO L225 Difference]: With dead ends: 135 [2018-01-20 22:07:02,620 INFO L226 Difference]: Without dead ends: 75 [2018-01-20 22:07:02,620 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-20 22:07:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-20 22:07:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-20 22:07:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-01-20 22:07:02,627 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 52 [2018-01-20 22:07:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:02,627 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-01-20 22:07:02,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-01-20 22:07:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-20 22:07:02,629 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:02,629 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:07:02,629 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:07:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1509918347, now seen corresponding path program 1 times [2018-01-20 22:07:02,629 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:02,630 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:02,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:02,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:02,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:02,681 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-20 22:07:02,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:02,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:02,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:02,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:02,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:02,683 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 3 states. [2018-01-20 22:07:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:02,716 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2018-01-20 22:07:02,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:02,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-20 22:07:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:02,718 INFO L225 Difference]: With dead ends: 113 [2018-01-20 22:07:02,718 INFO L226 Difference]: Without dead ends: 86 [2018-01-20 22:07:02,719 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-20 22:07:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-20 22:07:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-20 22:07:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-20 22:07:02,726 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 54 [2018-01-20 22:07:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:02,726 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-20 22:07:02,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-20 22:07:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-20 22:07:02,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:02,728 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-20 22:07:02,728 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:07:02,728 INFO L82 PathProgramCache]: Analyzing trace with hash 407838655, now seen corresponding path program 1 times [2018-01-20 22:07:02,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:02,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:02,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:02,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:02,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:07:02,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:02,797 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:07:02,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:02,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:02,877 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc0.base| Int)) (and (<= (select |c_old(#valid)| |append_#t~malloc0.base|) 0) (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc0.base| 1)))) is different from true [2018-01-20 22:07:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:07:02,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:07:02,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 22:07:02,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:07:02,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:07:02,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-20 22:07:02,936 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-01-20 22:07:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:02,978 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-20 22:07:02,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:07:02,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-01-20 22:07:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:02,978 INFO L225 Difference]: With dead ends: 106 [2018-01-20 22:07:02,978 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:07:02,979 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-20 22:07:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:07:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:07:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:07:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:07:02,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2018-01-20 22:07:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:02,980 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:07:02,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:07:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:07:02,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:07:02,981 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:02,982 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:02,982 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:02,982 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:02,982 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:02,982 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:02,982 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:02,982 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-20 22:07:02,982 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-20 22:07:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 22:07:02,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:02,984 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:07:02,984 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1183827267, now seen corresponding path program 1 times [2018-01-20 22:07:02,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:02,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:02,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:02,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:02,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:03,017 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-20 22:07:03,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:03,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:03,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:03,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:03,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:03,018 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2018-01-20 22:07:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:03,031 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2018-01-20 22:07:03,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:03,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-20 22:07:03,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:03,033 INFO L225 Difference]: With dead ends: 146 [2018-01-20 22:07:03,033 INFO L226 Difference]: Without dead ends: 49 [2018-01-20 22:07:03,033 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-20 22:07:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-20 22:07:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-20 22:07:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-20 22:07:03,038 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2018-01-20 22:07:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:03,038 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-20 22:07:03,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-20 22:07:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 22:07:03,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:03,039 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:07:03,039 INFO L371 AbstractCegarLoop]: === Iteration 2 === [appendErr0EnsuresViolation]=== [2018-01-20 22:07:03,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1135019040, now seen corresponding path program 1 times [2018-01-20 22:07:03,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:03,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:03,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:03,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:03,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:03,104 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:07:03,111 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:07:03,117 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:07:03,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:07:03 BoogieIcfgContainer [2018-01-20 22:07:03,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:07:03,134 INFO L168 Benchmark]: Toolchain (without parser) took 2477.14 ms. Allocated memory was 307.8 MB in the beginning and 470.3 MB in the end (delta: 162.5 MB). Free memory was 267.7 MB in the beginning and 434.9 MB in the end (delta: -167.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:07:03,135 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 307.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:07:03,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.95 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 255.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:07:03,135 INFO L168 Benchmark]: Boogie Preprocessor took 35.35 ms. Allocated memory is still 307.8 MB. Free memory was 255.7 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:07:03,135 INFO L168 Benchmark]: RCFGBuilder took 382.96 ms. Allocated memory is still 307.8 MB. Free memory was 253.7 MB in the beginning and 227.7 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:07:03,135 INFO L168 Benchmark]: TraceAbstraction took 1805.87 ms. Allocated memory was 307.8 MB in the beginning and 470.3 MB in the end (delta: 162.5 MB). Free memory was 227.7 MB in the beginning and 434.9 MB in the end (delta: -207.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:07:03,137 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.14 ms. Allocated memory is still 307.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.95 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 255.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.35 ms. Allocated memory is still 307.8 MB. Free memory was 255.7 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 382.96 ms. Allocated memory is still 307.8 MB. Free memory was 253.7 MB in the beginning and 227.7 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1805.87 ms. Allocated memory was 307.8 MB in the beginning and 470.3 MB in the end (delta: 162.5 MB). Free memory was 227.7 MB in the beginning and 434.9 MB in the end (delta: -207.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 80 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 80 locations, 4 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 283 SDtfs, 20 SDslu, 187 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 305 ConstructedInterpolants, 13 QuantifiedInterpolants, 37290 SizeOfPredicates, 3 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 24/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 80 locations, 4 error locations. SAFE Result, 0.4s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 279 SDtfs, 20 SDslu, 183 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 295 ConstructedInterpolants, 13 QuantifiedInterpolants, 35674 SizeOfPredicates, 3 NumberOfNonLiveVariables, 297 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 24/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 539]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L555] EXPR, FCALL malloc(sizeof *list) VAL [malloc(sizeof *list)={19:0}] [L555] struct list_t *list = malloc(sizeof *list); VAL [list={19:0}, malloc(sizeof *list)={19:0}] [L556] FCALL list->first = ((void *)0) VAL [list={19:0}, malloc(sizeof *list)={19:0}] [L557] FCALL list->last = ((void *)0) VAL [list={19:0}, malloc(sizeof *list)={19:0}] [L558] EXPR, FCALL malloc(sizeof *list2) VAL [list={19:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L558] struct list_t *list2 = malloc(sizeof *list2); VAL [list={19:0}, list2={16:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L559] FCALL list2->first = ((void *)0) VAL [list={19:0}, list2={16:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L560] FCALL list2->last = ((void *)0) VAL [list={19:0}, list2={16:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L561] char userInput; VAL [list={19:0}, list2={16:0}, malloc(sizeof *list)={19:0}, malloc(sizeof *list2)={16:0}] [L563] char userInput = __VERIFIER_nondet_char(); [L564] CALL append(list, userInput) VAL [\old(input)=0, head={19:0}] [L540] EXPR, FCALL malloc(sizeof *node) VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}] [L540] struct node_t *node = malloc(sizeof *node); VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L541] FCALL node->data = input VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] EXPR, FCALL head->first VAL [\old(input)=0, head={19:0}, head={19:0}, head->first={0:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] head->first == ((void *)0) && head->last == ((void *)0) VAL [\old(input)=0, head={19:0}, head={19:0}, head->first={0:0}, head->first == ((void *)0) && head->last == ((void *)0)=1, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] EXPR, FCALL head->last VAL [\old(input)=0, head={19:0}, head={19:0}, head->first={0:0}, head->first == ((void *)0) && head->last == ((void *)0)=1, head->last={0:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] head->first == ((void *)0) && head->last == ((void *)0) VAL [\old(input)=0, head={19:0}, head={19:0}, head->first={0:0}, head->first == ((void *)0) && head->last == ((void *)0)=1, head->last={0:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L542] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L543] FCALL head->first = node VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L544] FCALL head->last= node VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L545] FCALL node->prev = ((void *)0) VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] [L546] FCALL node->next = ((void *)0) VAL [\old(input)=0, head={19:0}, head={19:0}, input=0, malloc(sizeof *node)={12:0}, node={12:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 80 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 85 SDtfs, 0 SDslu, 80 SDs, 0 SdLazy, 6 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-07-03-147.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-07-03-147.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-07-03-147.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-07-03-147.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-07-03-147.csv Received shutdown request...