java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:16:41,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:16:41,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:16:41,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:16:41,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:16:41,763 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:16:41,764 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:16:41,766 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:16:41,768 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:16:41,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:16:41,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:16:41,770 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:16:41,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:16:41,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:16:41,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:16:41,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:16:41,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:16:41,780 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:16:41,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:16:41,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:16:41,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:16:41,786 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:16:41,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:16:41,787 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:16:41,788 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:16:41,789 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:16:41,790 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:16:41,790 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:16:41,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:16:41,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:16:41,792 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:16:41,792 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-25 00:16:41,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:16:41,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:16:41,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:16:41,803 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:16:41,804 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:16:41,804 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:16:41,804 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:16:41,804 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:16:41,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:16:41,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:16:41,805 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:16:41,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:16:41,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:16:41,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:16:41,806 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:16:41,806 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:16:41,806 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:16:41,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:16:41,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:16:41,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:16:41,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:16:41,807 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:16:41,808 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:16:41,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:16:41,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:16:41,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:16:41,809 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:16:41,809 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:16:41,809 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:16:41,809 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:16:41,809 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:16:41,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:16:41,810 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:16:41,810 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:16:41,811 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:16:41,811 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:16:41,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:16:41,862 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:16:41,866 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:16:41,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:16:41,868 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:16:41,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-01-25 00:16:42,056 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:16:42,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:16:42,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:16:42,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:16:42,071 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:16:42,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:16:42" (1/1) ... [2018-01-25 00:16:42,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277e5d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42, skipping insertion in model container [2018-01-25 00:16:42,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:16:42" (1/1) ... [2018-01-25 00:16:42,093 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:16:42,133 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:16:42,261 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:16:42,275 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:16:42,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42 WrapperNode [2018-01-25 00:16:42,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:16:42,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:16:42,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:16:42,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:16:42,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42" (1/1) ... [2018-01-25 00:16:42,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42" (1/1) ... [2018-01-25 00:16:42,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42" (1/1) ... [2018-01-25 00:16:42,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42" (1/1) ... [2018-01-25 00:16:42,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42" (1/1) ... [2018-01-25 00:16:42,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42" (1/1) ... [2018-01-25 00:16:42,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42" (1/1) ... [2018-01-25 00:16:42,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:16:42,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:16:42,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:16:42,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:16:42,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42" (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-25 00:16:42,370 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:16:42,370 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:16:42,370 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-25 00:16:42,370 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:16:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 00:16:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 00:16:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:16:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:16:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:16:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:16:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:16:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 00:16:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:16:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:16:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-25 00:16:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:16:42,373 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:16:42,373 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:16:42,544 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:16:42,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:16:42 BoogieIcfgContainer [2018-01-25 00:16:42,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:16:42,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:16:42,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:16:42,547 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:16:42,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:16:42" (1/3) ... [2018-01-25 00:16:42,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5016e160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:16:42, skipping insertion in model container [2018-01-25 00:16:42,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:16:42" (2/3) ... [2018-01-25 00:16:42,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5016e160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:16:42, skipping insertion in model container [2018-01-25 00:16:42,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:16:42" (3/3) ... [2018-01-25 00:16:42,550 INFO L105 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-01-25 00:16:42,557 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:16:42,563 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 00:16:42,610 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:16:42,610 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:16:42,610 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:16:42,610 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:16:42,610 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:16:42,611 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:16:42,611 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:16:42,611 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:16:42,612 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:16:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-25 00:16:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 00:16:42,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:16:42,640 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:16:42,640 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 00:16:42,645 INFO L82 PathProgramCache]: Analyzing trace with hash -119107064, now seen corresponding path program 1 times [2018-01-25 00:16:42,648 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:16:42,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:42,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:16:42,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:42,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:16:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:16:42,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:16:42,775 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-25 00:16:42,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:16:42,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:16:42,777 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:16:42,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 00:16:42,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 00:16:42,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 00:16:42,792 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-01-25 00:16:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:16:42,810 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-25 00:16:42,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 00:16:42,811 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-25 00:16:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:16:42,820 INFO L225 Difference]: With dead ends: 54 [2018-01-25 00:16:42,820 INFO L226 Difference]: Without dead ends: 31 [2018-01-25 00:16:42,823 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-25 00:16:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-25 00:16:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-25 00:16:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 00:16:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-25 00:16:42,933 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 9 [2018-01-25 00:16:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:16:42,933 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-25 00:16:42,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 00:16:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-25 00:16:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 00:16:42,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:16:42,934 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:16:42,934 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 00:16:42,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918584, now seen corresponding path program 1 times [2018-01-25 00:16:42,934 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:16:42,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:42,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:16:42,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:42,936 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:16:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:16:42,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:16:42,985 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-25 00:16:42,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:16:42,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:16:42,986 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:16:42,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:16:42,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:16:42,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:16:42,988 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 3 states. [2018-01-25 00:16:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:16:43,044 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-01-25 00:16:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:16:43,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 00:16:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:16:43,045 INFO L225 Difference]: With dead ends: 47 [2018-01-25 00:16:43,045 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 00:16:43,046 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-25 00:16:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 00:16:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-01-25 00:16:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 00:16:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-01-25 00:16:43,051 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 12 [2018-01-25 00:16:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:16:43,052 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-01-25 00:16:43,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:16:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-01-25 00:16:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 00:16:43,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:16:43,052 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:16:43,052 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 00:16:43,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918540, now seen corresponding path program 1 times [2018-01-25 00:16:43,053 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:16:43,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:16:43,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,054 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:16:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:16:43,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:16:43,095 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-25 00:16:43,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:16:43,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:16:43,096 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:16:43,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:16:43,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:16:43,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:16:43,097 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2018-01-25 00:16:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:16:43,152 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-01-25 00:16:43,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:16:43,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 00:16:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:16:43,153 INFO L225 Difference]: With dead ends: 56 [2018-01-25 00:16:43,154 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 00:16:43,154 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-25 00:16:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 00:16:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-01-25 00:16:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 00:16:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-25 00:16:43,160 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2018-01-25 00:16:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:16:43,160 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-25 00:16:43,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:16:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-25 00:16:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 00:16:43,161 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:16:43,161 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:16:43,161 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 00:16:43,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605995, now seen corresponding path program 1 times [2018-01-25 00:16:43,162 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:16:43,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:16:43,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,163 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:16:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:16:43,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:16:43,210 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-25 00:16:43,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:16:43,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:16:43,211 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:16:43,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:16:43,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:16:43,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:16:43,212 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-01-25 00:16:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:16:43,278 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-01-25 00:16:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:16:43,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 00:16:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:16:43,280 INFO L225 Difference]: With dead ends: 36 [2018-01-25 00:16:43,280 INFO L226 Difference]: Without dead ends: 34 [2018-01-25 00:16:43,280 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:16:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-25 00:16:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-01-25 00:16:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 00:16:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-01-25 00:16:43,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 13 [2018-01-25 00:16:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:16:43,286 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-01-25 00:16:43,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:16:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-01-25 00:16:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 00:16:43,287 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:16:43,287 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:16:43,287 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 00:16:43,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605994, now seen corresponding path program 1 times [2018-01-25 00:16:43,287 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:16:43,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:16:43,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,289 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:16:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:16:43,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:16:43,392 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-25 00:16:43,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:16:43,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:16:43,393 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:16:43,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:16:43,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:16:43,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:16:43,394 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states. [2018-01-25 00:16:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:16:43,431 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-01-25 00:16:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:16:43,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 00:16:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:16:43,432 INFO L225 Difference]: With dead ends: 34 [2018-01-25 00:16:43,432 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 00:16:43,433 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:16:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 00:16:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-01-25 00:16:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-25 00:16:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-01-25 00:16:43,438 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 13 [2018-01-25 00:16:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:16:43,438 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-01-25 00:16:43,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:16:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-01-25 00:16:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 00:16:43,439 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:16:43,439 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:16:43,439 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 00:16:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash -252306105, now seen corresponding path program 1 times [2018-01-25 00:16:43,440 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:16:43,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:16:43,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,441 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:16:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:16:43,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:16:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:16:43,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:16:43,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:16:43,492 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:16:43,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:16:43,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:16:43,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:16:43,494 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-01-25 00:16:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:16:43,585 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-25 00:16:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:16:43,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-25 00:16:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:16:43,586 INFO L225 Difference]: With dead ends: 48 [2018-01-25 00:16:43,586 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 00:16:43,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:16:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 00:16:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-01-25 00:16:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 00:16:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-01-25 00:16:43,592 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21 [2018-01-25 00:16:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:16:43,592 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-01-25 00:16:43,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:16:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-01-25 00:16:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 00:16:43,593 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:16:43,593 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:16:43,593 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 00:16:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash -252306061, now seen corresponding path program 1 times [2018-01-25 00:16:43,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:16:43,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:16:43,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,595 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:16:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:16:43,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:16:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:16:43,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:16:43,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:16:43,640 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:16:43,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:16:43,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:16:43,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:16:43,641 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states. [2018-01-25 00:16:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:16:43,723 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-25 00:16:43,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:16:43,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-25 00:16:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:16:43,724 INFO L225 Difference]: With dead ends: 41 [2018-01-25 00:16:43,724 INFO L226 Difference]: Without dead ends: 39 [2018-01-25 00:16:43,725 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:16:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-25 00:16:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-01-25 00:16:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 00:16:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-25 00:16:43,728 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2018-01-25 00:16:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:16:43,728 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-25 00:16:43,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:16:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-25 00:16:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 00:16:43,729 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:16:43,729 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:16:43,729 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 00:16:43,730 INFO L82 PathProgramCache]: Analyzing trace with hash -252306060, now seen corresponding path program 1 times [2018-01-25 00:16:43,730 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:16:43,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:16:43,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,731 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:16:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:16:43,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:16:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:16:43,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:16:43,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 00:16:43,819 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:16:43,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:16:43,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:16:43,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:16:43,820 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 5 states. [2018-01-25 00:16:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:16:43,897 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-01-25 00:16:43,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:16:43,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-25 00:16:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:16:43,898 INFO L225 Difference]: With dead ends: 43 [2018-01-25 00:16:43,898 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 00:16:43,898 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:16:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 00:16:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-01-25 00:16:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 00:16:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-25 00:16:43,902 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 21 [2018-01-25 00:16:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:16:43,903 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-25 00:16:43,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:16:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-25 00:16:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 00:16:43,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:16:43,903 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:16:43,904 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 00:16:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash -633867851, now seen corresponding path program 1 times [2018-01-25 00:16:43,904 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:16:43,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:16:43,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:16:43,905 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:16:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 00:16:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 00:16:43,955 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 00:16:43,969 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 00:16:43,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:16:43 BoogieIcfgContainer [2018-01-25 00:16:43,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:16:43,981 INFO L168 Benchmark]: Toolchain (without parser) took 1924.61 ms. Allocated memory was 305.7 MB in the beginning and 471.9 MB in the end (delta: 166.2 MB). Free memory was 265.6 MB in the beginning and 342.0 MB in the end (delta: -76.5 MB). Peak memory consumption was 89.7 MB. Max. memory is 5.3 GB. [2018-01-25 00:16:43,982 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:16:43,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.57 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:16:43,983 INFO L168 Benchmark]: Boogie Preprocessor took 36.31 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:16:43,983 INFO L168 Benchmark]: RCFGBuilder took 225.45 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 236.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-01-25 00:16:43,983 INFO L168 Benchmark]: TraceAbstraction took 1434.87 ms. Allocated memory was 305.7 MB in the beginning and 471.9 MB in the end (delta: 166.2 MB). Free memory was 236.4 MB in the beginning and 342.0 MB in the end (delta: -105.7 MB). Peak memory consumption was 60.5 MB. Max. memory is 5.3 GB. [2018-01-25 00:16:43,984 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.23 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.57 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.31 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 225.45 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 236.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1434.87 ms. Allocated memory was 305.7 MB in the beginning and 471.9 MB in the end (delta: 166.2 MB). Free memory was 236.4 MB in the beginning and 342.0 MB in the end (delta: -105.7 MB). Peak memory consumption was 60.5 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List t; [L628] List p = 0; VAL [p={0:0}] [L629] COND TRUE __VERIFIER_nondet_int() [L630] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}] [L630] t = (List) malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L631] COND FALSE !(t == 0) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L632] FCALL t->h = 1 VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L633] FCALL t->n = p VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L634] p = t VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, t={11:0}] [L629] COND FALSE !(__VERIFIER_nondet_int()) [L636] COND TRUE p!=0 VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, t={11:0}] [L637] EXPR, FCALL p->h VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=1, t={11:0}] [L637] COND FALSE !(p->h != 1) [L640] EXPR, FCALL p->n VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, p->n={0:0}, t={11:0}] [L640] p = p->n [L636] COND FALSE !(p!=0) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. UNSAFE Result, 1.3s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 262 SDslu, 144 SDs, 0 SdLazy, 154 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=2, 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, 8 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-16-43-990.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-16-43-990.csv Received shutdown request...