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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:29:02,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:29:02,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:29:02,852 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:29:02,853 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:29:02,854 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:29:02,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:29:02,856 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:29:02,858 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:29:02,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:29:02,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:29:02,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:29:02,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:29:02,861 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:29:02,862 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:29:02,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:29:02,866 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:29:02,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:29:02,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:29:02,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:29:02,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:29:02,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:29:02,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:29:02,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:29:02,877 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:29:02,878 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:29:02,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:29:02,879 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:29:02,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:29:02,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:29:02,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:29:02,881 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:29:02,892 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:29:02,892 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:29:02,893 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:29:02,893 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:29:02,893 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:29:02,893 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:29:02,894 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:29:02,894 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:29:02,894 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:29:02,895 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:29:02,895 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:29:02,895 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:29:02,895 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:29:02,895 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:29:02,895 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:29:02,896 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:29:02,896 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:29:02,896 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:29:02,896 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:29:02,896 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:29:02,896 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:29:02,897 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:29:02,897 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:29:02,897 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:29:02,897 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:29:02,897 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:29:02,897 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:29:02,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:29:02,898 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:29:02,898 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:29:02,898 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:29:02,898 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:29:02,898 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:29:02,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:29:02,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:29:02,899 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:29:02,899 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:29:02,900 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:29:02,900 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:29:02,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:29:02,950 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:29:02,954 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:29:02,955 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:29:02,972 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:29:02,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i [2018-01-21 00:29:03,139 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:29:03,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:29:03,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:03,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:29:03,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:29:03,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:03" (1/1) ... [2018-01-21 00:29:03,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8319445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03, skipping insertion in model container [2018-01-21 00:29:03,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:03" (1/1) ... [2018-01-21 00:29:03,167 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:03,205 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:03,323 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:03,343 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:03,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03 WrapperNode [2018-01-21 00:29:03,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:03,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:29:03,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:29:03,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:29:03,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03" (1/1) ... [2018-01-21 00:29:03,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03" (1/1) ... [2018-01-21 00:29:03,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03" (1/1) ... [2018-01-21 00:29:03,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03" (1/1) ... [2018-01-21 00:29:03,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03" (1/1) ... [2018-01-21 00:29:03,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03" (1/1) ... [2018-01-21 00:29:03,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03" (1/1) ... [2018-01-21 00:29:03,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:29:03,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:29:03,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:29:03,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:29:03,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03" (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-21 00:29:03,454 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:29:03,454 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:29:03,454 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-21 00:29:03,455 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:29:03,455 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:29:03,455 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:29:03,455 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:29:03,455 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:29:03,455 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:29:03,455 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:29:03,455 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:29:03,455 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:29:03,456 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-21 00:29:03,456 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:29:03,456 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:29:03,456 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:29:03,696 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:29:03,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:03 BoogieIcfgContainer [2018-01-21 00:29:03,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:29:03,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:29:03,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:29:03,699 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:29:03,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:29:03" (1/3) ... [2018-01-21 00:29:03,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55143fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:03, skipping insertion in model container [2018-01-21 00:29:03,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:03" (2/3) ... [2018-01-21 00:29:03,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55143fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:03, skipping insertion in model container [2018-01-21 00:29:03,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:03" (3/3) ... [2018-01-21 00:29:03,702 INFO L105 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i [2018-01-21 00:29:03,708 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:29:03,715 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:29:03,759 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:03,759 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:03,760 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:03,760 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:03,760 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:03,760 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:03,760 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:03,760 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:29:03,761 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-21 00:29:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:29:03,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:03,785 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:29:03,785 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:29:03,789 INFO L82 PathProgramCache]: Analyzing trace with hash 135503, now seen corresponding path program 1 times [2018-01-21 00:29:03,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:03,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:03,833 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:03,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:03,833 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:03,883 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:03,889 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:03,896 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:03,896 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:03,896 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:03,896 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:03,897 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:03,897 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:03,897 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:03,897 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == lisErr0EnsuresViolation======== [2018-01-21 00:29:03,897 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-21 00:29:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 00:29:03,901 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:03,901 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] [2018-01-21 00:29:03,901 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr0EnsuresViolation]=== [2018-01-21 00:29:03,902 INFO L82 PathProgramCache]: Analyzing trace with hash 642040304, now seen corresponding path program 1 times [2018-01-21 00:29:03,902 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:03,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:03,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:03,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:03,903 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:03,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:03,977 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-21 00:29:03,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:03,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:03,979 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:03,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:04,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:04,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:04,071 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-01-21 00:29:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:04,093 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2018-01-21 00:29:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:04,095 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 00:29:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:04,105 INFO L225 Difference]: With dead ends: 98 [2018-01-21 00:29:04,106 INFO L226 Difference]: Without dead ends: 49 [2018-01-21 00:29:04,108 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-21 00:29:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-21 00:29:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-21 00:29:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-21 00:29:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-21 00:29:04,140 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 21 [2018-01-21 00:29:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:04,140 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-21 00:29:04,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-21 00:29:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 00:29:04,142 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:04,142 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] [2018-01-21 00:29:04,142 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr0EnsuresViolation]=== [2018-01-21 00:29:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash -669511868, now seen corresponding path program 1 times [2018-01-21 00:29:04,142 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:04,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:04,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:04,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:04,144 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:04,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:04,717 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-21 00:29:04,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:04,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 00:29:04,718 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:04,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:29:04,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:29:04,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:29:04,721 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2018-01-21 00:29:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:04,980 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-01-21 00:29:04,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:29:04,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-21 00:29:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:04,981 INFO L225 Difference]: With dead ends: 49 [2018-01-21 00:29:04,982 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:04,983 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-21 00:29:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:04,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 00:29:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:04,984 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:04,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:29:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:04,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:04,987 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:04,987 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:04,987 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:04,987 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:04,987 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:04,987 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:04,987 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:04,987 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:29:04,987 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-21 00:29:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:29:04,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:04,990 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] [2018-01-21 00:29:04,990 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:04,991 INFO L82 PathProgramCache]: Analyzing trace with hash 434696604, now seen corresponding path program 1 times [2018-01-21 00:29:04,991 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:04,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:04,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:04,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:04,992 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:05,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:05,020 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-21 00:29:05,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:05,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:05,021 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:05,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:05,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:05,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:05,022 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-01-21 00:29:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:05,029 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2018-01-21 00:29:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:05,029 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 00:29:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:05,031 INFO L225 Difference]: With dead ends: 98 [2018-01-21 00:29:05,031 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 00:29:05,032 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-21 00:29:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 00:29:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 00:29:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 00:29:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-21 00:29:05,040 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 26 [2018-01-21 00:29:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:05,040 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-21 00:29:05,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-21 00:29:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 00:29:05,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:05,042 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-21 00:29:05,042 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2005608248, now seen corresponding path program 1 times [2018-01-21 00:29:05,043 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:05,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:05,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:05,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:05,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:05,093 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:05,102 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:05,108 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:05,109 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:05,110 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:05,123 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:05,124 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:05,124 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:05,124 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:05,124 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:05,124 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:05,124 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:05,124 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:29:05,124 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-21 00:29:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 00:29:05,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:05,126 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] [2018-01-21 00:29:05,127 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:05,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1533411526, now seen corresponding path program 1 times [2018-01-21 00:29:05,127 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:05,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:05,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:05,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:05,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:05,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:05,150 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-21 00:29:05,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:05,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:05,151 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:05,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:05,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:05,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:05,152 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-01-21 00:29:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:05,157 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2018-01-21 00:29:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:05,158 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 00:29:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:05,159 INFO L225 Difference]: With dead ends: 98 [2018-01-21 00:29:05,159 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 00:29:05,160 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-21 00:29:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 00:29:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 00:29:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 00:29:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-01-21 00:29:05,167 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 24 [2018-01-21 00:29:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:05,167 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-01-21 00:29:05,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-01-21 00:29:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:29:05,169 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:05,169 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] [2018-01-21 00:29:05,169 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash 400147186, now seen corresponding path program 1 times [2018-01-21 00:29:05,170 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:05,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:05,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:05,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:05,171 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:05,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:05,214 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-21 00:29:05,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:05,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:05,215 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:05,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:29:05,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:29:05,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:29:05,216 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 3 states. [2018-01-21 00:29:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:05,242 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-01-21 00:29:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:29:05,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-21 00:29:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:05,246 INFO L225 Difference]: With dead ends: 52 [2018-01-21 00:29:05,246 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:05,247 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-21 00:29:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:05,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 00:29:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:05,248 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:05,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:29:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:05,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:05,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:29:05 BoogieIcfgContainer [2018-01-21 00:29:05,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:29:05,252 INFO L168 Benchmark]: Toolchain (without parser) took 2112.46 ms. Allocated memory was 306.2 MB in the beginning and 465.6 MB in the end (delta: 159.4 MB). Free memory was 264.3 MB in the beginning and 338.2 MB in the end (delta: -73.9 MB). Peak memory consumption was 85.5 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:05,253 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 306.2 MB. Free memory is still 270.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:29:05,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.90 ms. Allocated memory is still 306.2 MB. Free memory was 263.3 MB in the beginning and 253.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:05,254 INFO L168 Benchmark]: Boogie Preprocessor took 36.37 ms. Allocated memory is still 306.2 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:05,254 INFO L168 Benchmark]: RCFGBuilder took 307.48 ms. Allocated memory is still 306.2 MB. Free memory was 251.2 MB in the beginning and 232.1 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:05,255 INFO L168 Benchmark]: TraceAbstraction took 1553.78 ms. Allocated memory was 306.2 MB in the beginning and 465.6 MB in the end (delta: 159.4 MB). Free memory was 231.1 MB in the beginning and 338.2 MB in the end (delta: -107.1 MB). Peak memory consumption was 52.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:05,256 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.25 ms. Allocated memory is still 306.2 MB. Free memory is still 270.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.90 ms. Allocated memory is still 306.2 MB. Free memory was 263.3 MB in the beginning and 253.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.37 ms. Allocated memory is still 306.2 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 307.48 ms. Allocated memory is still 306.2 MB. Free memory was 251.2 MB in the beginning and 232.1 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1553.78 ms. Allocated memory was 306.2 MB in the beginning and 465.6 MB in the end (delta: 159.4 MB). Free memory was 231.1 MB in the beginning and 338.2 MB in the end (delta: -107.1 MB). Peak memory consumption was 52.2 MB. 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) - 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, 58 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=58occurred 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: 540]: 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: lisErr0EnsuresViolation CFG has 4 procedures, 58 locations, 4 error locations. SAFE Result, 1.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 77 SDslu, 127 SDs, 0 SdLazy, 110 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 8082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL, EXPR lis(a, N) VAL [\old(N)=0, a={3:5}] [L542] int *best, *prev, i, j, max = 0; VAL [\old(N)=0, a={3:5}, a={3:5}, max=0, N=0] [L543] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=0, a={3:5}, a={3:5}, malloc(sizeof(int) * N)={4:0}, max=0, N=0] [L543] best = (int*) malloc(sizeof(int) * N) VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, malloc(sizeof(int) * N)={4:0}, max=0, N=0] [L544] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0] [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, i=0, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0, prev={6:0}] [L545] COND FALSE !(i < N) VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, i=0, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0, prev={6:0}] [L547] i = 1 VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, i=1, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0, prev={6:0}] [L547] COND FALSE !(i < N) VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, i=1, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0, prev={6:0}] [L551] i = 0 VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, i=0, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0, prev={6:0}] [L551] COND FALSE !(i < N) VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, i=0, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0, prev={6:0}] [L554] FCALL free(best) VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, i=0, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0, prev={6:0}] [L555] FCALL free(prev) VAL [\old(N)=0, a={3:5}, a={3:5}, best={4:0}, i=0, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0, prev={6:0}] [L556] RET return max; VAL [\old(N)=0, \result=0, a={3:5}, a={3:5}, best={4:0}, i=0, malloc(sizeof(int) * N)={4:0}, malloc(sizeof(int) * N)={6:0}, max=0, N=0, prev={6:0}] [L561] EXPR lis(a, N) VAL [a={3:5}, lis(a, N)=0, N=0] [L561] return lis(a, N); - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 58 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 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 - PositiveResult [Line: 558]: 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, 58 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 1 SDslu, 42 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 1465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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/lis_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-29-05-265.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-29-05-265.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-29-05-265.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-29-05-265.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-29-05-265.csv Received shutdown request...