java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 02:54:36,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 02:54:36,447 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 02:54:36,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 02:54:36,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 02:54:36,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 02:54:36,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 02:54:36,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 02:54:36,467 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 02:54:36,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 02:54:36,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 02:54:36,469 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 02:54:36,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 02:54:36,471 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 02:54:36,472 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 02:54:36,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 02:54:36,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 02:54:36,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 02:54:36,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 02:54:36,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 02:54:36,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 02:54:36,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 02:54:36,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 02:54:36,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 02:54:36,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 02:54:36,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 02:54:36,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 02:54:36,489 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 02:54:36,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 02:54:36,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 02:54:36,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 02:54:36,490 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-21 02:54:36,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 02:54:36,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 02:54:36,502 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 02:54:36,502 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 02:54:36,502 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 02:54:36,502 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 02:54:36,503 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 02:54:36,503 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 02:54:36,503 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 02:54:36,504 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 02:54:36,504 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 02:54:36,504 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 02:54:36,504 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 02:54:36,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 02:54:36,505 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 02:54:36,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 02:54:36,505 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 02:54:36,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 02:54:36,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 02:54:36,506 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 02:54:36,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 02:54:36,506 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 02:54:36,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 02:54:36,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 02:54:36,507 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 02:54:36,507 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 02:54:36,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 02:54:36,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 02:54:36,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 02:54:36,508 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 02:54:36,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 02:54:36,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 02:54:36,508 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 02:54:36,509 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 02:54:36,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 02:54:36,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 02:54:36,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 02:54:36,509 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 02:54:36,510 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 02:54:36,511 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 02:54:36,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 02:54:36,561 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 02:54:36,565 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 02:54:36,567 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 02:54:36,568 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 02:54:36,568 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-21 02:54:36,779 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 02:54:36,784 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 02:54:36,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 02:54:36,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 02:54:36,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 02:54:36,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 02:54:36" (1/1) ... [2018-01-21 02:54:36,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b942210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36, skipping insertion in model container [2018-01-21 02:54:36,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 02:54:36" (1/1) ... [2018-01-21 02:54:36,807 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 02:54:36,849 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 02:54:36,972 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 02:54:36,993 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 02:54:36,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36 WrapperNode [2018-01-21 02:54:37,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 02:54:37,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 02:54:37,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 02:54:37,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 02:54:37,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36" (1/1) ... [2018-01-21 02:54:37,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36" (1/1) ... [2018-01-21 02:54:37,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36" (1/1) ... [2018-01-21 02:54:37,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36" (1/1) ... [2018-01-21 02:54:37,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36" (1/1) ... [2018-01-21 02:54:37,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36" (1/1) ... [2018-01-21 02:54:37,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36" (1/1) ... [2018-01-21 02:54:37,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 02:54:37,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 02:54:37,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 02:54:37,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 02:54:37,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 02:54:37,092 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 02:54:37,093 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 02:54:37,093 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-21 02:54:37,093 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-21 02:54:37,093 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 02:54:37,093 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 02:54:37,094 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 02:54:37,094 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 02:54:37,094 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 02:54:37,094 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 02:54:37,094 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 02:54:37,094 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 02:54:37,094 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 02:54:37,095 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 02:54:37,095 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 02:54:37,095 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-21 02:54:37,095 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-21 02:54:37,095 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 02:54:37,095 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 02:54:37,095 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 02:54:37,415 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 02:54:37,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 02:54:37 BoogieIcfgContainer [2018-01-21 02:54:37,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 02:54:37,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 02:54:37,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 02:54:37,422 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 02:54:37,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 02:54:36" (1/3) ... [2018-01-21 02:54:37,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce304a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 02:54:37, skipping insertion in model container [2018-01-21 02:54:37,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:54:36" (2/3) ... [2018-01-21 02:54:37,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce304a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 02:54:37, skipping insertion in model container [2018-01-21 02:54:37,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 02:54:37" (3/3) ... [2018-01-21 02:54:37,427 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-01-21 02:54:37,437 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 02:54:37,446 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-21 02:54:37,494 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:54:37,494 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:54:37,494 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:54:37,494 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:54:37,494 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:54:37,495 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:54:37,495 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:54:37,495 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == popErr0EnsuresViolation======== [2018-01-21 02:54:37,495 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:54:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 02:54:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 02:54:37,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:37,521 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:37,521 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr0EnsuresViolation]=== [2018-01-21 02:54:37,525 INFO L82 PathProgramCache]: Analyzing trace with hash 816843792, now seen corresponding path program 1 times [2018-01-21 02:54:37,527 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:37,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:37,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:37,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:37,570 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:37,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:54:37,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:54:37,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-21 02:54:37,723 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:54:37,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:54:37,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:54:37,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:54:37,740 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 02:54:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:37,850 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-01-21 02:54:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:54:37,851 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-21 02:54:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:37,857 INFO L225 Difference]: With dead ends: 75 [2018-01-21 02:54:37,858 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 02:54:37,862 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:54:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 02:54:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 02:54:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 02:54:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 02:54:37,883 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 02:54:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:37,884 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 02:54:37,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:54:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 02:54:37,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 02:54:37,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 02:54:37,911 INFO L401 ceAbstractionStarter]: For program point L681(line 681) no Hoare annotation was computed. [2018-01-21 02:54:37,911 INFO L401 ceAbstractionStarter]: For program point L680(line 680) no Hoare annotation was computed. [2018-01-21 02:54:37,911 INFO L401 ceAbstractionStarter]: For program point popEXIT(lines 660 687) no Hoare annotation was computed. [2018-01-21 02:54:37,911 INFO L401 ceAbstractionStarter]: For program point L663(lines 663 686) no Hoare annotation was computed. [2018-01-21 02:54:37,912 INFO L404 ceAbstractionStarter]: At program point popENTRY(lines 660 687) the Hoare annotation is: true [2018-01-21 02:54:37,912 INFO L401 ceAbstractionStarter]: For program point L682(line 682) no Hoare annotation was computed. [2018-01-21 02:54:37,912 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-21 02:54:37,912 INFO L401 ceAbstractionStarter]: For program point L672'(line 672) no Hoare annotation was computed. [2018-01-21 02:54:37,912 INFO L401 ceAbstractionStarter]: For program point L664(line 664) no Hoare annotation was computed. [2018-01-21 02:54:37,913 INFO L401 ceAbstractionStarter]: For program point L682'(line 682) no Hoare annotation was computed. [2018-01-21 02:54:37,913 INFO L401 ceAbstractionStarter]: For program point L668(lines 668 669) no Hoare annotation was computed. [2018-01-21 02:54:37,913 INFO L401 ceAbstractionStarter]: For program point L674(line 674) no Hoare annotation was computed. [2018-01-21 02:54:37,913 INFO L401 ceAbstractionStarter]: For program point L672(line 672) no Hoare annotation was computed. [2018-01-21 02:54:37,913 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-21 02:54:37,913 INFO L401 ceAbstractionStarter]: For program point L675(lines 675 678) no Hoare annotation was computed. [2018-01-21 02:54:37,913 INFO L401 ceAbstractionStarter]: For program point L675''(lines 675 678) no Hoare annotation was computed. [2018-01-21 02:54:37,914 INFO L401 ceAbstractionStarter]: For program point L681'(line 681) no Hoare annotation was computed. [2018-01-21 02:54:37,914 INFO L401 ceAbstractionStarter]: For program point popErr0EnsuresViolation(lines 660 687) no Hoare annotation was computed. [2018-01-21 02:54:37,914 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 707) no Hoare annotation was computed. [2018-01-21 02:54:37,914 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 707) no Hoare annotation was computed. [2018-01-21 02:54:37,914 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 707) the Hoare annotation is: true [2018-01-21 02:54:37,914 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 707) no Hoare annotation was computed. [2018-01-21 02:54:37,915 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 707) the Hoare annotation is: true [2018-01-21 02:54:37,915 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 707) no Hoare annotation was computed. [2018-01-21 02:54:37,915 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 707) the Hoare annotation is: true [2018-01-21 02:54:37,915 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 707) no Hoare annotation was computed. [2018-01-21 02:54:37,915 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 707) no Hoare annotation was computed. [2018-01-21 02:54:37,915 INFO L404 ceAbstractionStarter]: At program point L694'(line 694) the Hoare annotation is: true [2018-01-21 02:54:37,915 INFO L401 ceAbstractionStarter]: For program point L690'(line 690) no Hoare annotation was computed. [2018-01-21 02:54:37,916 INFO L401 ceAbstractionStarter]: For program point L697'(line 697) no Hoare annotation was computed. [2018-01-21 02:54:37,916 INFO L401 ceAbstractionStarter]: For program point L696'''(lines 696 700) no Hoare annotation was computed. [2018-01-21 02:54:37,916 INFO L401 ceAbstractionStarter]: For program point L690'''(line 690) no Hoare annotation was computed. [2018-01-21 02:54:37,917 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 688 707) no Hoare annotation was computed. [2018-01-21 02:54:37,917 INFO L404 ceAbstractionStarter]: At program point L692(line 692) the Hoare annotation is: true [2018-01-21 02:54:37,917 INFO L401 ceAbstractionStarter]: For program point L691(lines 691 694) no Hoare annotation was computed. [2018-01-21 02:54:37,917 INFO L401 ceAbstractionStarter]: For program point L690(lines 690 695) no Hoare annotation was computed. [2018-01-21 02:54:37,917 INFO L401 ceAbstractionStarter]: For program point L696(lines 696 700) no Hoare annotation was computed. [2018-01-21 02:54:37,917 INFO L401 ceAbstractionStarter]: For program point L696''(lines 696 700) no Hoare annotation was computed. [2018-01-21 02:54:37,918 INFO L404 ceAbstractionStarter]: At program point L694(line 694) the Hoare annotation is: true [2018-01-21 02:54:37,918 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 688 707) no Hoare annotation was computed. [2018-01-21 02:54:37,918 INFO L401 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-01-21 02:54:37,918 INFO L401 ceAbstractionStarter]: For program point L697(line 697) no Hoare annotation was computed. [2018-01-21 02:54:37,918 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 688 707) no Hoare annotation was computed. [2018-01-21 02:54:37,918 INFO L401 ceAbstractionStarter]: For program point L698'(line 698) no Hoare annotation was computed. [2018-01-21 02:54:37,918 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-21 02:54:37,919 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-21 02:54:37,919 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-21 02:54:37,919 INFO L401 ceAbstractionStarter]: For program point L647''(lines 647 650) no Hoare annotation was computed. [2018-01-21 02:54:37,919 INFO L401 ceAbstractionStarter]: For program point L647(lines 647 650) no Hoare annotation was computed. [2018-01-21 02:54:37,919 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-21 02:54:37,919 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-21 02:54:37,919 INFO L404 ceAbstractionStarter]: At program point pushENTRY(lines 629 656) the Hoare annotation is: true [2018-01-21 02:54:37,920 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-21 02:54:37,920 INFO L401 ceAbstractionStarter]: For program point pushErr0EnsuresViolation(lines 629 656) no Hoare annotation was computed. [2018-01-21 02:54:37,920 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-21 02:54:37,920 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-21 02:54:37,920 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-21 02:54:37,920 INFO L401 ceAbstractionStarter]: For program point L631(lines 631 655) no Hoare annotation was computed. [2018-01-21 02:54:37,920 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-21 02:54:37,921 INFO L401 ceAbstractionStarter]: For program point pushEXIT(lines 629 656) no Hoare annotation was computed. [2018-01-21 02:54:37,921 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-21 02:54:37,921 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-21 02:54:37,925 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:54:37,925 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:54:37,925 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:54:37,925 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:54:37,925 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:54:37,925 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:54:37,926 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:54:37,926 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 02:54:37,926 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:54:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 02:54:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 02:54:37,929 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:37,929 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 02:54:37,929 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 02:54:37,929 INFO L82 PathProgramCache]: Analyzing trace with hash 169454, now seen corresponding path program 1 times [2018-01-21 02:54:37,930 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:37,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:37,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:37,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:37,931 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:54:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:54:37,982 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 02:54:37,992 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:54:38,033 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:54:38,034 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:54:38,034 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:54:38,034 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:54:38,034 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:54:38,034 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:54:38,034 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:54:38,034 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 02:54:38,034 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:54:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 02:54:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 02:54:38,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:38,052 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:38,052 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:54:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1316586551, now seen corresponding path program 1 times [2018-01-21 02:54:38,053 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:38,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:38,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,054 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:38,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:54:38,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:54:38,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:54:38,096 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:54:38,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:54:38,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:54:38,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:54:38,097 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 02:54:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:38,104 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-01-21 02:54:38,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:54:38,104 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-21 02:54:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:38,112 INFO L225 Difference]: With dead ends: 75 [2018-01-21 02:54:38,112 INFO L226 Difference]: Without dead ends: 57 [2018-01-21 02:54:38,112 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:54:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-21 02:54:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-21 02:54:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-21 02:54:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2018-01-21 02:54:38,128 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 11 [2018-01-21 02:54:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:38,128 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2018-01-21 02:54:38,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:54:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-01-21 02:54:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 02:54:38,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:38,129 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:38,129 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:54:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2092868013, now seen corresponding path program 1 times [2018-01-21 02:54:38,130 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:38,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:38,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,131 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:38,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:54:38,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:54:38,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 02:54:38,198 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:54:38,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 02:54:38,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 02:54:38,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 02:54:38,205 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 3 states. [2018-01-21 02:54:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:38,247 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2018-01-21 02:54:38,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 02:54:38,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 02:54:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:38,249 INFO L225 Difference]: With dead ends: 69 [2018-01-21 02:54:38,250 INFO L226 Difference]: Without dead ends: 58 [2018-01-21 02:54:38,251 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-21 02:54:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-21 02:54:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-21 02:54:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-21 02:54:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2018-01-21 02:54:38,259 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 15 [2018-01-21 02:54:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:38,259 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2018-01-21 02:54:38,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 02:54:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2018-01-21 02:54:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 02:54:38,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:38,261 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:38,261 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:54:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1392752657, now seen corresponding path program 1 times [2018-01-21 02:54:38,262 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:38,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:38,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:54:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:54:38,320 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 02:54:38,331 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:54:38,337 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:54:38,338 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:54:38,349 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:54:38,349 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:54:38,349 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:54:38,350 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:54:38,350 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:54:38,350 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:54:38,350 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:54:38,350 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 02:54:38,350 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:54:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 02:54:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-21 02:54:38,352 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:38,352 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:38,352 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1784608256, now seen corresponding path program 1 times [2018-01-21 02:54:38,352 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:38,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:38,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,353 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:38,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:54:38,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:54:38,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:54:38,385 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:54:38,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:54:38,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:54:38,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:54:38,386 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 02:54:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:38,392 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-01-21 02:54:38,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:54:38,392 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-21 02:54:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:38,393 INFO L225 Difference]: With dead ends: 75 [2018-01-21 02:54:38,394 INFO L226 Difference]: Without dead ends: 55 [2018-01-21 02:54:38,394 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:54:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-21 02:54:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-21 02:54:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-21 02:54:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-01-21 02:54:38,401 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 9 [2018-01-21 02:54:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:38,401 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-01-21 02:54:38,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:54:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-01-21 02:54:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 02:54:38,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:38,402 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:38,402 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1548658460, now seen corresponding path program 1 times [2018-01-21 02:54:38,402 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:38,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:38,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,403 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:38,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:54:38,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:54:38,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 02:54:38,462 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:54:38,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 02:54:38,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 02:54:38,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 02:54:38,463 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand 3 states. [2018-01-21 02:54:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:38,474 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2018-01-21 02:54:38,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 02:54:38,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-21 02:54:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:38,476 INFO L225 Difference]: With dead ends: 65 [2018-01-21 02:54:38,476 INFO L226 Difference]: Without dead ends: 56 [2018-01-21 02:54:38,476 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-21 02:54:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-21 02:54:38,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-21 02:54:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-21 02:54:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2018-01-21 02:54:38,481 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 13 [2018-01-21 02:54:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:38,482 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2018-01-21 02:54:38,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 02:54:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2018-01-21 02:54:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 02:54:38,482 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:38,483 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:38,483 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1605916762, now seen corresponding path program 1 times [2018-01-21 02:54:38,483 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:38,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:38,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,484 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:38,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:54:38,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:54:38,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:54:38,533 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:54:38,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 02:54:38,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 02:54:38,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 02:54:38,534 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 3 states. [2018-01-21 02:54:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:38,596 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-01-21 02:54:38,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 02:54:38,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-21 02:54:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:38,598 INFO L225 Difference]: With dead ends: 65 [2018-01-21 02:54:38,598 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 02:54:38,599 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-21 02:54:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 02:54:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-01-21 02:54:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-21 02:54:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2018-01-21 02:54:38,606 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 13 [2018-01-21 02:54:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:38,606 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2018-01-21 02:54:38,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 02:54:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2018-01-21 02:54:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 02:54:38,607 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:38,608 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:38,608 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:38,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1614897922, now seen corresponding path program 1 times [2018-01-21 02:54:38,608 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:38,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:38,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,610 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:38,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:54:38,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:54:38,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 02:54:38,677 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:54:38,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:54:38,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:54:38,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:54:38,679 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand 4 states. [2018-01-21 02:54:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:38,735 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2018-01-21 02:54:38,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 02:54:38,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-21 02:54:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:38,738 INFO L225 Difference]: With dead ends: 114 [2018-01-21 02:54:38,738 INFO L226 Difference]: Without dead ends: 100 [2018-01-21 02:54:38,738 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-21 02:54:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-21 02:54:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2018-01-21 02:54:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-21 02:54:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2018-01-21 02:54:38,763 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 19 [2018-01-21 02:54:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:38,763 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2018-01-21 02:54:38,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:54:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2018-01-21 02:54:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 02:54:38,767 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:38,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:38,767 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash -302614467, now seen corresponding path program 1 times [2018-01-21 02:54:38,767 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:38,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:38,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:38,769 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:38,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 02:54:38,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:54:38,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 02:54:38,891 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:54:38,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 02:54:38,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 02:54:38,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-21 02:54:38,893 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand 7 states. [2018-01-21 02:54:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:54:39,197 INFO L93 Difference]: Finished difference Result 227 states and 312 transitions. [2018-01-21 02:54:39,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 02:54:39,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-21 02:54:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:54:39,200 INFO L225 Difference]: With dead ends: 227 [2018-01-21 02:54:39,201 INFO L226 Difference]: Without dead ends: 174 [2018-01-21 02:54:39,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-21 02:54:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-21 02:54:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2018-01-21 02:54:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-21 02:54:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 207 transitions. [2018-01-21 02:54:39,225 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 207 transitions. Word has length 37 [2018-01-21 02:54:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:54:39,226 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 207 transitions. [2018-01-21 02:54:39,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 02:54:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 207 transitions. [2018-01-21 02:54:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 02:54:39,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:54:39,229 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:54:39,230 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 02:54:39,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1718063660, now seen corresponding path program 1 times [2018-01-21 02:54:39,230 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:54:39,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:39,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:54:39,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:54:39,232 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:54:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:54:39,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:54:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 02:54:39,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 02:54:39,510 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 02:54:39,511 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-01-21 02:54:39,513 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [13], [15], [21], [29], [33], [35], [36], [37], [38], [39], [43], [45], [87], [90], [91], [101], [107], [117], [120], [121], [122], [123], [124], [128], [130], [131], [139], [140], [141], [142], [143] [2018-01-21 02:54:39,563 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 02:54:39,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 02:54:39,865 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 02:54:39,868 INFO L168 Benchmark]: Toolchain (without parser) took 3089.10 ms. Allocated memory was 304.6 MB in the beginning and 480.2 MB in the end (delta: 175.6 MB). Free memory was 261.8 MB in the beginning and 369.7 MB in the end (delta: -107.9 MB). Peak memory consumption was 67.7 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:39,870 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.6 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 02:54:39,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.33 ms. Allocated memory is still 304.6 MB. Free memory was 261.8 MB in the beginning and 249.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:39,870 INFO L168 Benchmark]: Boogie Preprocessor took 39.60 ms. Allocated memory is still 304.6 MB. Free memory was 249.7 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:39,871 INFO L168 Benchmark]: RCFGBuilder took 376.27 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 224.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:39,871 INFO L168 Benchmark]: TraceAbstraction took 2447.97 ms. Allocated memory was 304.6 MB in the beginning and 480.2 MB in the end (delta: 175.6 MB). Free memory was 224.8 MB in the beginning and 369.7 MB in the end (delta: -144.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 5.3 GB. [2018-01-21 02:54:39,872 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.18 ms. Allocated memory is still 304.6 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.33 ms. Allocated memory is still 304.6 MB. Free memory was 261.8 MB in the beginning and 249.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.60 ms. Allocated memory is still 304.6 MB. Free memory was 249.7 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 376.27 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 224.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2447.97 ms. Allocated memory was 304.6 MB in the beginning and 480.2 MB in the end (delta: 175.6 MB). Free memory was 224.8 MB in the beginning and 369.7 MB in the end (delta: -144.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 660]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: popErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 8 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=15, \old(garbage)=17, \old(pc1)=7, \old(pc4)=11, \old(res4)=5, \old(S)=9, \old(S)=3, \old(t1)=8, \old(t1)=12, \old(t4)=16, \old(t4)=4, \old(x1)=14, \old(x1)=1, \old(x4)=6, \old(x4)=13, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 0 SDslu, 69 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_02-54-39-881.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_02-54-39-881.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_02-54-39-881.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_02-54-39-881.csv Received shutdown request...