java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:38:00,170 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:38:00,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:38:00,185 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:38:00,186 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:38:00,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:38:00,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:38:00,188 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:38:00,190 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:38:00,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:38:00,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:38:00,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:38:00,192 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:38:00,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:38:00,193 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:38:00,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:38:00,198 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:38:00,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:38:00,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:38:00,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:38:00,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:38:00,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:38:00,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:38:00,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:38:00,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:38:00,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:38:00,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:38:00,209 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:38:00,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:38:00,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:38:00,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:38:00,210 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:38:00,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:38:00,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:38:00,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:38:00,221 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:38:00,221 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:38:00,222 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:38:00,222 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:38:00,222 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:38:00,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:38:00,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:38:00,223 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:38:00,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:38:00,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:38:00,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:38:00,224 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:38:00,224 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:38:00,224 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:38:00,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:38:00,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:38:00,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:38:00,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:38:00,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:38:00,225 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:38:00,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:38:00,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:38:00,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:38:00,226 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:38:00,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:38:00,226 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:38:00,227 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:38:00,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:38:00,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:38:00,227 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:38:00,227 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:38:00,228 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:38:00,228 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:38:00,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:38:00,274 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:38:00,277 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:38:00,278 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:38:00,278 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:38:00,279 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-25 05:38:00,452 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:38:00,458 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:38:00,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:38:00,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:38:00,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:38:00,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:38:00" (1/1) ... [2018-01-25 05:38:00,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4430c394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00, skipping insertion in model container [2018-01-25 05:38:00,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:38:00" (1/1) ... [2018-01-25 05:38:00,479 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:38:00,517 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:38:00,637 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:38:00,661 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:38:00,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00 WrapperNode [2018-01-25 05:38:00,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:38:00,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:38:00,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:38:00,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:38:00,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00" (1/1) ... [2018-01-25 05:38:00,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00" (1/1) ... [2018-01-25 05:38:00,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00" (1/1) ... [2018-01-25 05:38:00,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00" (1/1) ... [2018-01-25 05:38:00,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00" (1/1) ... [2018-01-25 05:38:00,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00" (1/1) ... [2018-01-25 05:38:00,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00" (1/1) ... [2018-01-25 05:38:00,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:38:00,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:38:00,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:38:00,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:38:00,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:38:00,753 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:38:00,753 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:38:00,753 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-25 05:38:00,753 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-25 05:38:00,753 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:38:00,754 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:38:00,754 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:38:00,754 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:38:00,754 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:38:00,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:38:00,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:38:00,755 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:38:00,755 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:38:00,755 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:38:00,755 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:38:00,755 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-25 05:38:00,755 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-25 05:38:00,756 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:38:00,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:38:00,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:38:01,073 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:38:01,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:38:01 BoogieIcfgContainer [2018-01-25 05:38:01,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:38:01,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:38:01,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:38:01,077 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:38:01,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:38:00" (1/3) ... [2018-01-25 05:38:01,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da08a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:38:01, skipping insertion in model container [2018-01-25 05:38:01,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:00" (2/3) ... [2018-01-25 05:38:01,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da08a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:38:01, skipping insertion in model container [2018-01-25 05:38:01,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:38:01" (3/3) ... [2018-01-25 05:38:01,080 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2018-01-25 05:38:01,087 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:38:01,095 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-25 05:38:01,132 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:38:01,132 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:38:01,132 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:38:01,132 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:38:01,132 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:38:01,132 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:38:01,133 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:38:01,133 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:38:01,133 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:38:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-25 05:38:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 05:38:01,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:01,156 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:01,157 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-25 05:38:01,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-25 05:38:01,162 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:01,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:01,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:01,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:01,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:01,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:38:01,320 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:01,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:38:01,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:38:01,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:38:01,336 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-25 05:38:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:01,446 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-25 05:38:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:38:01,447 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-25 05:38:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:01,462 INFO L225 Difference]: With dead ends: 92 [2018-01-25 05:38:01,462 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:38:01,466 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:38:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:38:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 05:38:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 05:38:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-25 05:38:01,503 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-25 05:38:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:01,503 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-25 05:38:01,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:38:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-25 05:38:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:38:01,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:01,504 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:01,504 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-25 05:38:01,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-25 05:38:01,504 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:01,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:01,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:01,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:01,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:01,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:01,567 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:01,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:38:01,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:38:01,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:01,570 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-25 05:38:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:01,590 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-25 05:38:01,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:38:01,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:38:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:01,592 INFO L225 Difference]: With dead ends: 87 [2018-01-25 05:38:01,592 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 05:38:01,593 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 05:38:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-25 05:38:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 05:38:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-25 05:38:01,599 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-25 05:38:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:01,599 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-25 05:38:01,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:38:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-25 05:38:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:38:01,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:01,600 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:01,600 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-25 05:38:01,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-25 05:38:01,600 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:01,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:01,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,601 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:01,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:01,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:01,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:01,689 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:01,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:38:01,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:38:01,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:01,690 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-25 05:38:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:01,740 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-25 05:38:01,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:38:01,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:38:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:01,743 INFO L225 Difference]: With dead ends: 145 [2018-01-25 05:38:01,743 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 05:38:01,743 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-25 05:38:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 05:38:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-25 05:38:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 05:38:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-25 05:38:01,756 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-25 05:38:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:01,756 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-25 05:38:01,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:38:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-25 05:38:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:38:01,757 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:01,757 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:01,757 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-25 05:38:01,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-25 05:38:01,758 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:01,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:01,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,759 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:01,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:01,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:01,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:38:01,802 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:01,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:38:01,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:38:01,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:01,803 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-25 05:38:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:01,886 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-25 05:38:01,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:38:01,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-25 05:38:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:01,889 INFO L225 Difference]: With dead ends: 148 [2018-01-25 05:38:01,889 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 05:38:01,889 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 05:38:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-25 05:38:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 05:38:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-25 05:38:01,905 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-25 05:38:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:01,906 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-25 05:38:01,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:38:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-25 05:38:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:38:01,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:01,907 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:01,907 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-25 05:38:01,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-25 05:38:01,907 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:01,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:01,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:01,909 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:01,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:01,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:01,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:38:01,980 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:01,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:38:01,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:38:01,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:38:01,981 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-25 05:38:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:02,102 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-25 05:38:02,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:38:02,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 05:38:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:02,105 INFO L225 Difference]: With dead ends: 385 [2018-01-25 05:38:02,105 INFO L226 Difference]: Without dead ends: 255 [2018-01-25 05:38:02,107 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-25 05:38:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-25 05:38:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-25 05:38:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-25 05:38:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-25 05:38:02,132 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-25 05:38:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:02,133 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-25 05:38:02,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:38:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-25 05:38:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:38:02,134 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:02,134 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:02,134 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-25 05:38:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-25 05:38:02,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:02,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:02,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:02,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:02,136 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:02,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:02,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:02,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:02,181 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:02,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:38:02,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:38:02,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:38:02,182 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-25 05:38:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:02,299 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-25 05:38:02,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:38:02,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 05:38:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:02,304 INFO L225 Difference]: With dead ends: 390 [2018-01-25 05:38:02,304 INFO L226 Difference]: Without dead ends: 386 [2018-01-25 05:38:02,305 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-25 05:38:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-25 05:38:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-25 05:38:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-25 05:38:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-25 05:38:02,339 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-25 05:38:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:02,339 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-25 05:38:02,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:38:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-25 05:38:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:38:02,340 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:02,340 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:02,340 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-25 05:38:02,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-25 05:38:02,341 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:02,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:02,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:02,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:02,342 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:02,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:02,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:02,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:02,406 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:02,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:38:02,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:38:02,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:38:02,407 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-25 05:38:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:02,579 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-25 05:38:02,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:38:02,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 05:38:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:02,584 INFO L225 Difference]: With dead ends: 489 [2018-01-25 05:38:02,584 INFO L226 Difference]: Without dead ends: 485 [2018-01-25 05:38:02,585 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-25 05:38:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-25 05:38:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-25 05:38:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-25 05:38:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-25 05:38:02,618 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-25 05:38:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:02,619 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-25 05:38:02,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:38:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-25 05:38:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:38:02,620 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:02,620 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:02,620 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-25 05:38:02,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-25 05:38:02,621 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:02,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:02,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:02,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:02,622 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:02,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:02,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:02,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:38:02,706 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:02,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:38:02,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:38:02,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:38:02,707 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-25 05:38:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:02,813 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-25 05:38:02,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:38:02,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-25 05:38:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:02,818 INFO L225 Difference]: With dead ends: 1316 [2018-01-25 05:38:02,819 INFO L226 Difference]: Without dead ends: 861 [2018-01-25 05:38:02,820 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-25 05:38:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-25 05:38:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-25 05:38:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-25 05:38:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-25 05:38:02,865 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-25 05:38:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:02,866 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-25 05:38:02,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:38:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-25 05:38:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:38:02,867 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:02,868 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-25 05:38:02,868 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-25 05:38:02,868 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-25 05:38:02,868 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:02,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:02,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:02,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:02,869 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:02,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:02,966 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-25 05:38:02,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:02,966 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:38:02,967 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 05:38:02,969 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [15], [21], [98], [101], [102], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-25 05:38:03,017 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:38:03,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:38:03,205 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 05:38:03,207 INFO L268 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 39 variables. [2018-01-25 05:38:03,218 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 05:38:03,333 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 85.7% of their original sizes. [2018-01-25 05:38:03,333 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 05:38:03,365 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 05:38:03,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:38:03,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-25 05:38:03,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:03,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:38:03,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:38:03,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:38:03,367 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-01-25 05:38:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:06,093 INFO L93 Difference]: Finished difference Result 1786 states and 2584 transitions. [2018-01-25 05:38:06,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:38:06,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 05:38:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:06,100 INFO L225 Difference]: With dead ends: 1786 [2018-01-25 05:38:06,100 INFO L226 Difference]: Without dead ends: 963 [2018-01-25 05:38:06,103 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:38:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-01-25 05:38:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 942. [2018-01-25 05:38:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-01-25 05:38:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1359 transitions. [2018-01-25 05:38:06,169 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1359 transitions. Word has length 26 [2018-01-25 05:38:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:06,169 INFO L432 AbstractCegarLoop]: Abstraction has 942 states and 1359 transitions. [2018-01-25 05:38:06,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:38:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1359 transitions. [2018-01-25 05:38:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:38:06,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:06,171 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:06,172 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-25 05:38:06,172 INFO L82 PathProgramCache]: Analyzing trace with hash -938176756, now seen corresponding path program 1 times [2018-01-25 05:38:06,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:06,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:06,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:06,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:06,267 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-25 05:38:06,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:06,267 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:38:06,268 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 05:38:06,268 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [15], [21], [98], [101], [102], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-25 05:38:06,269 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:38:06,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:38:06,456 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:38:06,456 INFO L268 AbstractInterpreter]: Visited 20 different actions 43 times. Merged at 7 different actions 9 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 39 variables. [2018-01-25 05:38:06,461 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:38:06,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:06,462 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-25 05:38:06,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:06,470 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:38:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:06,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:38:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:06,682 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:38:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:06,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:06,971 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-25 05:38:06,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:06,979 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:38:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:07,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:38:07,111 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-25 05:38:07,112 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:38:07,197 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-25 05:38:07,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:38:07,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9, 6, 6] total 15 [2018-01-25 05:38:07,200 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:38:07,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:38:07,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:38:07,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:38:07,201 INFO L87 Difference]: Start difference. First operand 942 states and 1359 transitions. Second operand 10 states. [2018-01-25 05:38:08,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:08,159 INFO L93 Difference]: Finished difference Result 2687 states and 4104 transitions. [2018-01-25 05:38:08,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 05:38:08,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-25 05:38:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:08,171 INFO L225 Difference]: With dead ends: 2687 [2018-01-25 05:38:08,171 INFO L226 Difference]: Without dead ends: 1864 [2018-01-25 05:38:08,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:38:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2018-01-25 05:38:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1662. [2018-01-25 05:38:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2018-01-25 05:38:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2399 transitions. [2018-01-25 05:38:08,294 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2399 transitions. Word has length 26 [2018-01-25 05:38:08,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:08,295 INFO L432 AbstractCegarLoop]: Abstraction has 1662 states and 2399 transitions. [2018-01-25 05:38:08,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:38:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2399 transitions. [2018-01-25 05:38:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:38:08,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:08,296 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:08,296 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-25 05:38:08,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-01-25 05:38:08,297 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:08,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:08,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:08,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:08,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 05:38:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 05:38:08,366 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 05:38:08,400 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 05:38:08,411 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-25 05:38:08,412 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-25 05:38:08,414 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-25 05:38:08,414 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-25 05:38:08,416 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-25 05:38:08,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:38:08 BoogieIcfgContainer [2018-01-25 05:38:08,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:38:08,431 INFO L168 Benchmark]: Toolchain (without parser) took 7977.92 ms. Allocated memory was 302.0 MB in the beginning and 707.3 MB in the end (delta: 405.3 MB). Free memory was 262.0 MB in the beginning and 581.6 MB in the end (delta: -319.6 MB). Peak memory consumption was 85.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:08,431 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:38:08,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.98 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 250.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:08,432 INFO L168 Benchmark]: Boogie Preprocessor took 34.98 ms. Allocated memory is still 302.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:08,432 INFO L168 Benchmark]: RCFGBuilder took 370.28 ms. Allocated memory is still 302.0 MB. Free memory was 248.0 MB in the beginning and 222.4 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:08,433 INFO L168 Benchmark]: TraceAbstraction took 7355.31 ms. Allocated memory was 302.0 MB in the beginning and 707.3 MB in the end (delta: 405.3 MB). Free memory was 222.4 MB in the beginning and 581.6 MB in the end (delta: -359.2 MB). Peak memory consumption was 46.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:08,434 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.20 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.98 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 250.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.98 ms. Allocated memory is still 302.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 370.28 ms. Allocated memory is still 302.0 MB. Free memory was 248.0 MB in the beginning and 222.4 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7355.31 ms. Allocated memory was 302.0 MB in the beginning and 707.3 MB in the end (delta: 405.3 MB). Free memory was 222.4 MB in the beginning and 581.6 MB in the end (delta: -359.2 MB). Peak memory consumption was 46.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 7 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 175 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -14 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 12 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 94 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 15 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.655088 RENAME_VARIABLES(MILLISECONDS) : 0.178407 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.616183 PROJECTAWAY(MILLISECONDS) : 0.033884 ADD_WEAK_EQUALITY(MILLISECONDS) : 3.377569 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.222296 ADD_EQUALITY(MILLISECONDS) : 0.023005 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013645 #CONJOIN_DISJUNCTIVE : 15 #RENAME_VARIABLES : 26 #UNFREEZE : 0 #CONJOIN : 106 #PROJECTAWAY : 25 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 23 #ADD_EQUALITY : 92 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 406 LocStat_NO_SUPPORTING_DISEQUALITIES : 3 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 142 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.701701 RENAME_VARIABLES(MILLISECONDS) : 0.085184 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.671764 PROJECTAWAY(MILLISECONDS) : 0.085990 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.247168 DISJOIN(MILLISECONDS) : 0.176458 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.107491 ADD_EQUALITY(MILLISECONDS) : 0.036938 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.024415 #CONJOIN_DISJUNCTIVE : 85 #RENAME_VARIABLES : 177 #UNFREEZE : 0 #CONJOIN : 257 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 24 #RENAME_VARIABLES_DISJUNCTIVE : 155 #ADD_EQUALITY : 139 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 * 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, 7.3s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 938 SDtfs, 931 SDslu, 1423 SDs, 0 SdLazy, 529 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 190 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1662occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9787581699346404 AbsIntWeakeningRatio, 1.08 AbsIntAvgWeakeningVarsNumRemoved, 9.6 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 364 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 12214 SizeOfPredicates, 14 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 32/48 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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-38-08-446.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-38-08-446.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-38-08-446.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-38-08-446.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-38-08-446.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-38-08-446.csv Received shutdown request...