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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:02:41,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:02:41,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:02:41,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:02:41,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:02:41,029 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:02:41,030 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:02:41,032 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:02:41,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:02:41,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:02:41,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:02:41,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:02:41,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:02:41,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:02:41,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:02:41,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:02:41,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:02:41,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:02:41,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:02:41,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:02:41,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:02:41,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:02:41,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:02:41,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:02:41,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:02:41,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:02:41,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:02:41,054 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:02:41,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:02:41,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:02:41,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:02:41,055 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:02:41,065 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:02:41,065 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:02:41,066 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:02:41,066 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:02:41,066 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:02:41,067 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:02:41,067 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:02:41,068 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:02:41,068 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:02:41,068 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:02:41,068 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:02:41,068 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:02:41,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:02:41,069 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:02:41,069 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:02:41,069 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:02:41,069 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:02:41,070 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:02:41,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:02:41,070 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:02:41,070 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:02:41,070 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:02:41,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:02:41,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:02:41,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:02:41,071 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:02:41,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:02:41,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:02:41,072 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:02:41,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:02:41,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:02:41,072 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:02:41,073 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:02:41,074 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:02:41,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:02:41,121 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:02:41,124 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:02:41,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:02:41,126 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:02:41,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i [2018-01-24 13:02:41,315 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:02:41,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:02:41,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:02:41,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:02:41,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:02:41,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:02:41" (1/1) ... [2018-01-24 13:02:41,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41, skipping insertion in model container [2018-01-24 13:02:41,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:02:41" (1/1) ... [2018-01-24 13:02:41,348 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:02:41,387 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:02:41,513 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:02:41,537 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:02:41,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41 WrapperNode [2018-01-24 13:02:41,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:02:41,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:02:41,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:02:41,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:02:41,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41" (1/1) ... [2018-01-24 13:02:41,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41" (1/1) ... [2018-01-24 13:02:41,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41" (1/1) ... [2018-01-24 13:02:41,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41" (1/1) ... [2018-01-24 13:02:41,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41" (1/1) ... [2018-01-24 13:02:41,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41" (1/1) ... [2018-01-24 13:02:41,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41" (1/1) ... [2018-01-24 13:02:41,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:02:41,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:02:41,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:02:41,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:02:41,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41" (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 13:02:41,642 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:02:41,643 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:02:41,643 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 13:02:41,643 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 13:02:41,643 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:02:41,643 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:02:41,643 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:02:41,643 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:02:41,643 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:02:41,643 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:02:41,644 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:02:41,644 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:02:41,644 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:02:41,644 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:02:41,644 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:02:41,644 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 13:02:41,644 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 13:02:41,645 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:02:41,645 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:02:41,645 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:02:41,983 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:02:41,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:02:41 BoogieIcfgContainer [2018-01-24 13:02:41,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:02:41,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:02:41,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:02:41,987 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:02:41,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:02:41" (1/3) ... [2018-01-24 13:02:41,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:02:41, skipping insertion in model container [2018-01-24 13:02:41,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:41" (2/3) ... [2018-01-24 13:02:41,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:02:41, skipping insertion in model container [2018-01-24 13:02:41,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:02:41" (3/3) ... [2018-01-24 13:02:41,990 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2018-01-24 13:02:41,999 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:02:42,007 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 13:02:42,043 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:02:42,044 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:02:42,044 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:02:42,044 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:02:42,044 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:02:42,044 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:02:42,044 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:02:42,044 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:02:42,045 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:02:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 13:02:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 13:02:42,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:42,075 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:42,075 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 13:02:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 13:02:42,083 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:42,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:42,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:42,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:42,246 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 13:02:42,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:42,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:02:42,248 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:42,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 13:02:42,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 13:02:42,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:02:42,271 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 13:02:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:42,381 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 13:02:42,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 13:02:42,382 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 13:02:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:42,393 INFO L225 Difference]: With dead ends: 92 [2018-01-24 13:02:42,394 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 13:02:42,396 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 13:02:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 13:02:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 13:02:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 13:02:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 13:02:42,430 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 13:02:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:42,431 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 13:02:42,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 13:02:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 13:02:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:02:42,431 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:42,432 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:42,432 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 13:02:42,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 13:02:42,432 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:42,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:42,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,434 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:42,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:42,511 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 13:02:42,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:42,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:42,512 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:42,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:02:42,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:02:42,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:42,515 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 13:02:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:42,532 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 13:02:42,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:02:42,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 13:02:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:42,534 INFO L225 Difference]: With dead ends: 87 [2018-01-24 13:02:42,534 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 13:02:42,535 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 13:02:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 13:02:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 13:02:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 13:02:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 13:02:42,542 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 13:02:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:42,542 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 13:02:42,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:02:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 13:02:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:02:42,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:42,543 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:42,543 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 13:02:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 13:02:42,543 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:42,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:42,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,544 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:42,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:42,633 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 13:02:42,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:42,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:42,634 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:42,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:02:42,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:02:42,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:42,635 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 13:02:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:42,706 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 13:02:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:02:42,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 13:02:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:42,708 INFO L225 Difference]: With dead ends: 145 [2018-01-24 13:02:42,709 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 13:02:42,709 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 13:02:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 13:02:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 13:02:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 13:02:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 13:02:42,726 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 13:02:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:42,727 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 13:02:42,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:02:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 13:02:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:02:42,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:42,728 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:42,728 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 13:02:42,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 13:02:42,729 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:42,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:42,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,730 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:42,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:42,778 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 13:02:42,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:42,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:02:42,778 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:42,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:02:42,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:02:42,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:42,779 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 13:02:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:42,866 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 13:02:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:02:42,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 13:02:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:42,868 INFO L225 Difference]: With dead ends: 148 [2018-01-24 13:02:42,869 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 13:02:42,869 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 13:02:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 13:02:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 13:02:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 13:02:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 13:02:42,888 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 13:02:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:42,888 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 13:02:42,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:02:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 13:02:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:02:42,889 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:42,889 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:42,889 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 13:02:42,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 13:02:42,890 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:42,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:42,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:42,891 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:42,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:42,978 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 13:02:42,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:42,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:02:42,979 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:42,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:02:42,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:02:42,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:02:42,980 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 13:02:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:43,110 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 13:02:43,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:02:43,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 13:02:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:43,113 INFO L225 Difference]: With dead ends: 385 [2018-01-24 13:02:43,113 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 13:02:43,115 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 13:02:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 13:02:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 13:02:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 13:02:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 13:02:43,141 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 13:02:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:43,142 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 13:02:43,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:02:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 13:02:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:02:43,143 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:43,143 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:43,143 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 13:02:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 13:02:43,143 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:43,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:43,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:43,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:43,145 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:43,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:43,202 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 13:02:43,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:43,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:43,203 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:43,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:02:43,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:02:43,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:02:43,204 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 13:02:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:43,357 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-24 13:02:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:02:43,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:02:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:43,362 INFO L225 Difference]: With dead ends: 390 [2018-01-24 13:02:43,362 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 13:02:43,363 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 13:02:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 13:02:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-24 13:02:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 13:02:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 13:02:43,394 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 13:02:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:43,394 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 13:02:43,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:02:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 13:02:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:02:43,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:43,395 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:43,395 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 13:02:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 13:02:43,396 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:43,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:43,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:43,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:43,397 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:43,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:43,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-24 13:02:43,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:43,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:43,462 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:43,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:02:43,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:02:43,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:02:43,463 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 13:02:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:43,632 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-24 13:02:43,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:02:43,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:02:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:43,637 INFO L225 Difference]: With dead ends: 489 [2018-01-24 13:02:43,637 INFO L226 Difference]: Without dead ends: 485 [2018-01-24 13:02:43,638 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 13:02:43,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-24 13:02:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-24 13:02:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 13:02:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 13:02:43,673 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 13:02:43,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:43,674 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 13:02:43,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:02:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 13:02:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:02:43,675 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:43,675 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:43,676 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 13:02:43,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 13:02:43,677 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:43,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:43,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:43,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:43,678 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:43,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:43,773 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 13:02:43,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:43,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:02:43,774 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:43,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:02:43,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:02:43,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:02:43,774 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 13:02:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:43,899 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 13:02:43,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:02:43,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 13:02:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:43,906 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 13:02:43,906 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 13:02:43,909 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 13:02:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 13:02:43,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 13:02:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 13:02:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 13:02:43,953 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 13:02:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:43,953 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 13:02:43,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:02:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 13:02:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:02:43,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:43,955 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 13:02:43,955 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 13:02:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 13:02:43,955 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:43,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:43,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:43,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:43,956 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:43,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:44,065 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 13:02:44,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:44,065 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:02:44,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:44,089 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:44,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:44,312 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:44,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:44,689 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:02:44,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:44,694 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:44,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:44,825 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 13:02:44,825 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:44,888 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 13:02:44,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:02:44,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8, 6, 6] total 12 [2018-01-24 13:02:44,891 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:02:44,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:02:44,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:02:44,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:02:44,892 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-01-24 13:02:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:45,857 INFO L93 Difference]: Finished difference Result 2243 states and 3305 transitions. [2018-01-24 13:02:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 13:02:45,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 13:02:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:45,862 INFO L225 Difference]: With dead ends: 2243 [2018-01-24 13:02:45,863 INFO L226 Difference]: Without dead ends: 1420 [2018-01-24 13:02:45,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2018-01-24 13:02:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-01-24 13:02:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-01-24 13:02:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-01-24 13:02:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-01-24 13:02:45,929 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-01-24 13:02:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:45,929 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-01-24 13:02:45,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:02:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-01-24 13:02:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:02:45,931 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:45,931 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 13:02:45,931 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-01-24 13:02:45,931 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:45,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:45,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:45,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:45,932 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:45,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:46,117 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:46,117 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:02:46,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:46,123 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:46,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:46,430 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:46,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:02:46,600 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:02:46,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:46,606 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:02:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:46,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:02:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:46,698 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:02:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:46,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:02:46,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 6, 6] total 11 [2018-01-24 13:02:46,821 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:02:46,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:02:46,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:02:46,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:02:46,822 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 10 states. [2018-01-24 13:02:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:47,640 INFO L93 Difference]: Finished difference Result 5398 states and 7862 transitions. [2018-01-24 13:02:47,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:02:47,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-24 13:02:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:47,658 INFO L225 Difference]: With dead ends: 5398 [2018-01-24 13:02:47,658 INFO L226 Difference]: Without dead ends: 4135 [2018-01-24 13:02:47,662 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:02:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2018-01-24 13:02:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 3944. [2018-01-24 13:02:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2018-01-24 13:02:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5578 transitions. [2018-01-24 13:02:47,868 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5578 transitions. Word has length 27 [2018-01-24 13:02:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:47,869 INFO L432 AbstractCegarLoop]: Abstraction has 3944 states and 5578 transitions. [2018-01-24 13:02:47,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:02:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5578 transitions. [2018-01-24 13:02:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:02:47,870 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:47,870 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:47,870 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 13:02:47,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-01-24 13:02:47,871 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:47,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:47,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:47,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:47,872 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:02:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:02:47,929 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 13:02:47,962 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 13:02:47,974 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 13:02:47,975 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 13:02:47,976 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 13:02:47,977 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 13:02:47,979 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 13:02:47,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:02:47 BoogieIcfgContainer [2018-01-24 13:02:47,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:02:47,994 INFO L168 Benchmark]: Toolchain (without parser) took 6678.51 ms. Allocated memory was 302.5 MB in the beginning and 516.9 MB in the end (delta: 214.4 MB). Free memory was 262.5 MB in the beginning and 412.7 MB in the end (delta: -150.1 MB). Peak memory consumption was 64.3 MB. Max. memory is 5.3 GB. [2018-01-24 13:02:47,995 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:02:47,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.60 ms. Allocated memory is still 302.5 MB. Free memory was 261.5 MB in the beginning and 250.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:02:47,996 INFO L168 Benchmark]: Boogie Preprocessor took 35.46 ms. Allocated memory is still 302.5 MB. Free memory was 250.5 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:02:47,996 INFO L168 Benchmark]: RCFGBuilder took 393.64 ms. Allocated memory is still 302.5 MB. Free memory was 248.6 MB in the beginning and 223.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:02:47,996 INFO L168 Benchmark]: TraceAbstraction took 6008.64 ms. Allocated memory was 302.5 MB in the beginning and 516.9 MB in the end (delta: 214.4 MB). Free memory was 222.0 MB in the beginning and 412.7 MB in the end (delta: -190.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-01-24 13:02:47,998 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.12 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.60 ms. Allocated memory is still 302.5 MB. Free memory was 261.5 MB in the beginning and 250.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.46 ms. Allocated memory is still 302.5 MB. Free memory was 250.5 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 393.64 ms. Allocated memory is still 302.5 MB. Free memory was 248.6 MB in the beginning and 223.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6008.64 ms. Allocated memory was 302.5 MB in the beginning and 516.9 MB in the end (delta: 214.4 MB). Free memory was 222.0 MB in the beginning and 412.7 MB in the end (delta: -190.7 MB). Peak memory consumption was 23.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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible 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] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() 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}] [L631] pc1++ [L632] case 1: 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=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) 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}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) 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}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L634] FCALL x1->data = 0 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}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) 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}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() 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=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() 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, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(S || 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=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12: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 [\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, \result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. UNSAFE Result, 5.9s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 937 SDtfs, 1163 SDslu, 1708 SDs, 0 SdLazy, 625 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 218 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3944occurred in iteration=10, 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.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 484 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 23509 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1218 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 26/60 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-02-48-004.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-02-48-004.csv Received shutdown request...