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_mostprecise.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:06:04,517 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:06:04,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:06:04,532 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:06:04,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:06:04,534 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:06:04,535 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:06:04,536 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:06:04,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:06:04,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:06:04,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:06:04,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:06:04,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:06:04,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:06:04,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:06:04,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:06:04,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:06:04,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:06:04,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:06:04,554 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:06:04,556 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:06:04,556 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:06:04,557 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:06:04,558 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:06:04,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:06:04,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:06:04,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:06:04,561 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:06:04,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:06:04,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:06:04,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:06:04,563 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_mostprecise.epf [2018-01-24 20:06:04,572 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:06:04,573 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:06:04,574 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:06:04,574 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:06:04,574 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:06:04,574 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:06:04,575 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:06:04,575 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:06:04,575 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:06:04,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:06:04,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:06:04,576 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:06:04,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:06:04,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:06:04,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:06:04,577 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:06:04,577 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:06:04,577 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:06:04,578 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:06:04,578 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:06:04,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:06:04,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:06:04,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:06:04,579 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:06:04,579 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:06:04,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:06:04,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:06:04,580 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:06:04,580 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:06:04,580 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:06:04,580 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:06:04,580 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:06:04,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:06:04,581 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:06:04,581 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:06:04,582 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:06:04,582 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:06:04,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:06:04,631 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:06:04,635 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:06:04,636 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:06:04,637 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:06:04,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-01-24 20:06:04,804 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:06:04,809 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:06:04,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:06:04,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:06:04,816 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:06:04,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:06:04" (1/1) ... [2018-01-24 20:06:04,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4ba872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:04, skipping insertion in model container [2018-01-24 20:06:04,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:06:04" (1/1) ... [2018-01-24 20:06:04,832 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:06:04,871 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:06:04,991 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:06:05,011 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:06:05,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05 WrapperNode [2018-01-24 20:06:05,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:06:05,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:06:05,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:06:05,018 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:06:05,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05" (1/1) ... [2018-01-24 20:06:05,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05" (1/1) ... [2018-01-24 20:06:05,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05" (1/1) ... [2018-01-24 20:06:05,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05" (1/1) ... [2018-01-24 20:06:05,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05" (1/1) ... [2018-01-24 20:06:05,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05" (1/1) ... [2018-01-24 20:06:05,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05" (1/1) ... [2018-01-24 20:06:05,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:06:05,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:06:05,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:06:05,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:06:05,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:06:05,103 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:06:05,103 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:06:05,103 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 20:06:05,103 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 20:06:05,103 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:06:05,104 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:06:05,104 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:06:05,104 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 20:06:05,104 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 20:06:05,104 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:06:05,104 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:06:05,105 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:06:05,105 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:06:05,105 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:06:05,105 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:06:05,105 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 20:06:05,105 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 20:06:05,106 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:06:05,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:06:05,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:06:05,476 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:06:05,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:06:05 BoogieIcfgContainer [2018-01-24 20:06:05,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:06:05,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:06:05,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:06:05,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:06:05,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:06:04" (1/3) ... [2018-01-24 20:06:05,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543d26bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:06:05, skipping insertion in model container [2018-01-24 20:06:05,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:06:05" (2/3) ... [2018-01-24 20:06:05,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543d26bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:06:05, skipping insertion in model container [2018-01-24 20:06:05,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:06:05" (3/3) ... [2018-01-24 20:06:05,484 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-01-24 20:06:05,491 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:06:05,499 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 20:06:05,540 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:06:05,541 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:06:05,541 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:06:05,541 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:06:05,541 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:06:05,541 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:06:05,541 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:06:05,541 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:06:05,542 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:06:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 20:06:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 20:06:05,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:06:05,569 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:06:05,569 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:06:05,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 20:06:05,575 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:06:05,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:05,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:06:05,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:05,618 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:06:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:06:05,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:06:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:06:05,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:06:05,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:06:05,731 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:06:05,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 20:06:05,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 20:06:05,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 20:06:05,751 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 20:06:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:06:05,863 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 20:06:05,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 20:06:05,904 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 20:06:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:06:05,918 INFO L225 Difference]: With dead ends: 92 [2018-01-24 20:06:05,918 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 20:06:05,921 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-24 20:06:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 20:06:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 20:06:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 20:06:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 20:06:05,959 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 20:06:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:06:05,960 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 20:06:05,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 20:06:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 20:06:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 20:06:05,960 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:06:05,960 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:06:05,961 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:06:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 20:06:05,961 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:06:05,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:05,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:06:05,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:05,962 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:06:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:06:05,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:06:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:06:06,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:06:06,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:06:06,027 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:06:06,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:06:06,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:06:06,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:06:06,029 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 20:06:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:06:06,061 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 20:06:06,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:06:06,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 20:06:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:06:06,063 INFO L225 Difference]: With dead ends: 87 [2018-01-24 20:06:06,063 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 20:06:06,065 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-24 20:06:06,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 20:06:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 20:06:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 20:06:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 20:06:06,074 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 20:06:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:06:06,075 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 20:06:06,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:06:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 20:06:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 20:06:06,076 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:06:06,076 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:06:06,076 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:06:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 20:06:06,076 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:06:06,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:06:06,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,078 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:06:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:06:06,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:06:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:06:06,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:06:06,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:06:06,183 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:06:06,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:06:06,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:06:06,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:06:06,184 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 20:06:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:06:06,225 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 20:06:06,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:06:06,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 20:06:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:06:06,228 INFO L225 Difference]: With dead ends: 145 [2018-01-24 20:06:06,228 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 20:06:06,228 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:06:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 20:06:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 20:06:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 20:06:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 20:06:06,247 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 20:06:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:06:06,247 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 20:06:06,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:06:06,247 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 20:06:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 20:06:06,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:06:06,248 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:06:06,248 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:06:06,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 20:06:06,249 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:06:06,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:06:06,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:06:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:06:06,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:06:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:06:06,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:06:06,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:06:06,302 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:06:06,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:06:06,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:06:06,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:06:06,303 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 20:06:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:06:06,383 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 20:06:06,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:06:06,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 20:06:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:06:06,385 INFO L225 Difference]: With dead ends: 148 [2018-01-24 20:06:06,386 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 20:06:06,386 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-24 20:06:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 20:06:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 20:06:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 20:06:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 20:06:06,402 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 20:06:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:06:06,402 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 20:06:06,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:06:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 20:06:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 20:06:06,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:06:06,403 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:06:06,403 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:06:06,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 20:06:06,404 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:06:06,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:06:06,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,405 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:06:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:06:06,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:06:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:06:06,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:06:06,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:06:06,477 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:06:06,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:06:06,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:06:06,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:06:06,478 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 20:06:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:06:06,611 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 20:06:06,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:06:06,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 20:06:06,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:06:06,615 INFO L225 Difference]: With dead ends: 385 [2018-01-24 20:06:06,615 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 20:06:06,617 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:06:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 20:06:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 20:06:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 20:06:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 20:06:06,645 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 20:06:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:06:06,645 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 20:06:06,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:06:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 20:06:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 20:06:06,646 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:06:06,646 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:06:06,646 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:06:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 20:06:06,647 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:06:06,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:06:06,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,648 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:06:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:06:06,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:06:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:06:06,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:06:06,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:06:06,709 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:06:06,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:06:06,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:06:06,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:06:06,710 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 20:06:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:06:06,876 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-24 20:06:06,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:06:06,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 20:06:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:06:06,880 INFO L225 Difference]: With dead ends: 390 [2018-01-24 20:06:06,881 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 20:06:06,881 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:06:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 20:06:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-24 20:06:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 20:06:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 20:06:06,917 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 20:06:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:06:06,917 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 20:06:06,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:06:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 20:06:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 20:06:06,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:06:06,919 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:06:06,919 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:06:06,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 20:06:06,919 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:06:06,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:06:06,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:06,921 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:06:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:06:06,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:06:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:06:07,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:06:07,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:06:07,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:06:07,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:06:07,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:06:07,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:06:07,011 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 20:06:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:06:07,249 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-24 20:06:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:06:07,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 20:06:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:06:07,254 INFO L225 Difference]: With dead ends: 489 [2018-01-24 20:06:07,254 INFO L226 Difference]: Without dead ends: 485 [2018-01-24 20:06:07,255 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:06:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-24 20:06:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-24 20:06:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 20:06:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 20:06:07,288 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 20:06:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:06:07,288 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 20:06:07,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:06:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 20:06:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 20:06:07,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:06:07,290 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:06:07,290 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:06:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 20:06:07,291 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:06:07,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:07,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:06:07,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:07,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:06:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:06:07,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:06:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:06:07,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:06:07,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:06:07,350 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:06:07,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:06:07,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:06:07,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:06:07,351 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 20:06:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:06:07,462 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 20:06:07,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:06:07,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 20:06:07,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:06:07,469 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 20:06:07,469 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 20:06:07,472 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:06:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 20:06:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 20:06:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 20:06:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 20:06:07,533 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 20:06:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:06:07,534 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 20:06:07,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:06:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 20:06:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:06:07,535 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:06:07,536 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:06:07,536 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:06:07,536 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 20:06:07,536 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:06:07,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:07,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:06:07,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:06:07,538 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:06:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:06:07,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:06:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:06:07,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:06:07,621 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:06:07,622 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 20:06:07,624 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [15], [21], [98], [101], [102], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-24 20:06:07,693 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:06:07,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:06:07,982 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 20:06:07,983 INFO L268 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 39 variables. [2018-01-24 20:06:07,990 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 20:06:08,148 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.81% of their original sizes. [2018-01-24 20:06:08,148 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 20:06:08,171 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 20:06:08,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:06:08,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-24 20:06:08,172 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:06:08,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:06:08,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:06:08,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:06:08,173 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. Received shutdown request... [2018-01-24 20:07:10,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:07:10,950 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:07:10,954 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:07:10,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:07:10 BoogieIcfgContainer [2018-01-24 20:07:10,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:07:10,955 INFO L168 Benchmark]: Toolchain (without parser) took 66150.43 ms. Allocated memory was 308.8 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 266.1 MB in the beginning and 753.8 MB in the end (delta: -487.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 20:07:10,955 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.8 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:07:10,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.81 ms. Allocated memory is still 308.8 MB. Free memory was 266.1 MB in the beginning and 254.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:07:10,956 INFO L168 Benchmark]: Boogie Preprocessor took 33.21 ms. Allocated memory is still 308.8 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:07:10,956 INFO L168 Benchmark]: RCFGBuilder took 425.66 ms. Allocated memory is still 308.8 MB. Free memory was 252.0 MB in the beginning and 227.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-01-24 20:07:10,956 INFO L168 Benchmark]: TraceAbstraction took 65475.89 ms. Allocated memory was 308.8 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 227.4 MB in the beginning and 753.8 MB in the end (delta: -526.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 20:07:10,957 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.16 ms. Allocated memory is still 308.8 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.81 ms. Allocated memory is still 308.8 MB. Free memory was 266.1 MB in the beginning and 254.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.21 ms. Allocated memory is still 308.8 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 425.66 ms. Allocated memory is still 308.8 MB. Free memory was 252.0 MB in the beginning and 227.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65475.89 ms. Allocated memory was 308.8 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 227.4 MB in the beginning and 753.8 MB in the end (delta: -526.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 7 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 175 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -14 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 12 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 92 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 14 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.885007 RENAME_VARIABLES(MILLISECONDS) : 0.159634 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.815065 PROJECTAWAY(MILLISECONDS) : 0.052680 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.267862 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.214827 ADD_EQUALITY(MILLISECONDS) : 0.038053 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015982 #CONJOIN_DISJUNCTIVE : 15 #RENAME_VARIABLES : 25 #UNFREEZE : 0 #CONJOIN : 103 #PROJECTAWAY : 24 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 23 #ADD_EQUALITY : 91 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 65.4s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 63.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 832 SDtfs, 424 SDslu, 1146 SDs, 0 SdLazy, 270 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=828occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9787581699346404 AbsIntWeakeningRatio, 1.08 AbsIntAvgWeakeningVarsNumRemoved, 9.44 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 141 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 4489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 7/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-07-10-969.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-07-10-969.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-07-10-969.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-07-10-969.csv Completed graceful shutdown