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.0_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:40:05,152 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:40:05,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:40:05,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:40:05,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:40:05,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:40:05,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:40:05,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:40:05,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:40:05,170 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:40:05,171 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:40:05,171 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:40:05,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:40:05,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:40:05,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:40:05,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:40:05,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:40:05,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:40:05,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:40:05,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:40:05,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:40:05,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:40:05,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:40:05,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:40:05,187 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:40:05,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:40:05,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:40:05,190 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:40:05,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:40:05,190 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:40:05,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:40:05,191 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:40:05,201 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:40:05,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:40:05,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:40:05,202 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:40:05,202 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:40:05,203 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:40:05,203 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:40:05,203 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:40:05,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:40:05,204 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:40:05,204 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:40:05,204 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:40:05,204 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:40:05,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:40:05,204 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:40:05,204 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:40:05,205 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:40:05,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:40:05,205 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:40:05,205 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:40:05,205 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:40:05,205 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:40:05,206 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:40:05,206 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:40:05,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:40:05,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:40:05,206 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:40:05,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:40:05,207 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:40:05,207 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:40:05,207 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:40:05,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:40:05,207 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:40:05,207 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:40:05,208 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:40:05,208 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:40:05,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:40:05,251 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:40:05,255 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:40:05,256 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:40:05,256 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:40:05,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i [2018-01-25 05:40:05,422 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:40:05,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:40:05,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:40:05,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:40:05,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:40:05,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:40:05" (1/1) ... [2018-01-25 05:40:05,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a042b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05, skipping insertion in model container [2018-01-25 05:40:05,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:40:05" (1/1) ... [2018-01-25 05:40:05,456 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:40:05,495 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:40:05,623 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:40:05,647 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:40:05,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05 WrapperNode [2018-01-25 05:40:05,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:40:05,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:40:05,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:40:05,655 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:40:05,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05" (1/1) ... [2018-01-25 05:40:05,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05" (1/1) ... [2018-01-25 05:40:05,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05" (1/1) ... [2018-01-25 05:40:05,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05" (1/1) ... [2018-01-25 05:40:05,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05" (1/1) ... [2018-01-25 05:40:05,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05" (1/1) ... [2018-01-25 05:40:05,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05" (1/1) ... [2018-01-25 05:40:05,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:40:05,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:40:05,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:40:05,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:40:05,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:40:05,746 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:40:05,746 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:40:05,746 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-25 05:40:05,746 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-25 05:40:05,746 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:40:05,746 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:40:05,746 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:40:05,747 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:40:05,747 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:40:05,747 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:40:05,747 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:40:05,747 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:40:05,747 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:40:05,748 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:40:05,748 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:40:05,748 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-25 05:40:05,748 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-25 05:40:05,748 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:40:05,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:40:05,749 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:40:06,137 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:40:06,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:40:06 BoogieIcfgContainer [2018-01-25 05:40:06,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:40:06,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:40:06,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:40:06,141 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:40:06,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:40:05" (1/3) ... [2018-01-25 05:40:06,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49367b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:40:06, skipping insertion in model container [2018-01-25 05:40:06,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:40:05" (2/3) ... [2018-01-25 05:40:06,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49367b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:40:06, skipping insertion in model container [2018-01-25 05:40:06,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:40:06" (3/3) ... [2018-01-25 05:40:06,146 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-01-25 05:40:06,155 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:40:06,162 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-25 05:40:06,209 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:40:06,209 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:40:06,209 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:40:06,209 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:40:06,209 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:40:06,209 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:40:06,209 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:40:06,209 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:40:06,210 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:40:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-25 05:40:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 05:40:06,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:06,238 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:40:06,238 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:40:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-25 05:40:06,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:06,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:06,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:06,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:06,301 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:06,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:06,423 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:40:06,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:40:06,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:40:06,426 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:06,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:40:06,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:40:06,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:40:06,449 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-25 05:40:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:06,566 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-25 05:40:06,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:40:06,567 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-25 05:40:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:06,578 INFO L225 Difference]: With dead ends: 92 [2018-01-25 05:40:06,578 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:40:06,580 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:40:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:40:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 05:40:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 05:40:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-25 05:40:06,618 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-25 05:40:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:06,618 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-25 05:40:06,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:40:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-25 05:40:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:40:06,619 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:06,619 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:40:06,619 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:40:06,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-25 05:40:06,620 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:06,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:06,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:06,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:06,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:06,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:06,686 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:40:06,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:40:06,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:40:06,687 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:06,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:40:06,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:40:06,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:40:06,689 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-25 05:40:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:06,711 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-25 05:40:06,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:40:06,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:40:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:06,714 INFO L225 Difference]: With dead ends: 87 [2018-01-25 05:40:06,714 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 05:40:06,715 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:40:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 05:40:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-25 05:40:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 05:40:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-25 05:40:06,724 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-25 05:40:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:06,725 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-25 05:40:06,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:40:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-25 05:40:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:40:06,726 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:06,726 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:40:06,726 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:40:06,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-25 05:40:06,726 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:06,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:06,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:06,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:06,728 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:06,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:06,860 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:40:06,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:40:06,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:40:06,861 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:06,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:40:06,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:40:06,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:40:06,862 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-25 05:40:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:06,905 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-25 05:40:06,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:40:06,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:40:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:06,908 INFO L225 Difference]: With dead ends: 145 [2018-01-25 05:40:06,908 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 05:40:06,910 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:40:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 05:40:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-25 05:40:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 05:40:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-25 05:40:06,930 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-25 05:40:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:06,930 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-25 05:40:06,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:40:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-25 05:40:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:40:06,931 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:06,931 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:40:06,931 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:40:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-25 05:40:06,932 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:06,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:06,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:06,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:06,933 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:06,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:06,996 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:40:06,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:40:06,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:40:06,996 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:06,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:40:06,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:40:06,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:40:06,998 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-25 05:40:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:07,092 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-25 05:40:07,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:40:07,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-25 05:40:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:07,094 INFO L225 Difference]: With dead ends: 148 [2018-01-25 05:40:07,094 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 05:40:07,094 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:40:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 05:40:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-25 05:40:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 05:40:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-25 05:40:07,110 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-25 05:40:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:07,111 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-25 05:40:07,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:40:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-25 05:40:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:40:07,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:07,111 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:40:07,112 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:40:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-25 05:40:07,112 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:07,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:07,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:07,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:07,113 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:07,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:07,214 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:40:07,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:40:07,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:40:07,215 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:07,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:40:07,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:40:07,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:40:07,216 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-25 05:40:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:07,567 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-25 05:40:07,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:40:07,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 05:40:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:07,569 INFO L225 Difference]: With dead ends: 385 [2018-01-25 05:40:07,570 INFO L226 Difference]: Without dead ends: 255 [2018-01-25 05:40:07,571 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:40:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-25 05:40:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-25 05:40:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-25 05:40:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-25 05:40:07,599 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-25 05:40:07,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:07,599 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-25 05:40:07,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:40:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-25 05:40:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:40:07,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:07,600 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:40:07,600 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:40:07,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-25 05:40:07,601 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:07,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:07,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:07,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:07,602 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:07,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:07,657 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:40:07,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:40:07,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:40:07,657 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:07,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:40:07,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:40:07,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:40:07,658 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-25 05:40:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:07,849 INFO L93 Difference]: Finished difference Result 392 states and 582 transitions. [2018-01-25 05:40:07,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:40:07,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 05:40:07,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:07,853 INFO L225 Difference]: With dead ends: 392 [2018-01-25 05:40:07,853 INFO L226 Difference]: Without dead ends: 388 [2018-01-25 05:40:07,854 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:40:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-01-25 05:40:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-01-25 05:40:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-25 05:40:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-25 05:40:07,892 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-25 05:40:07,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:07,892 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-25 05:40:07,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:40:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-25 05:40:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:40:07,894 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:07,894 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:40:07,894 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:40:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-25 05:40:07,895 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:07,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:07,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:07,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:07,896 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:07,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:07,974 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:40:07,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:40:07,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:40:07,975 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:07,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:40:07,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:40:07,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:40:07,976 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-25 05:40:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:08,129 INFO L93 Difference]: Finished difference Result 491 states and 729 transitions. [2018-01-25 05:40:08,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:40:08,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 05:40:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:08,133 INFO L225 Difference]: With dead ends: 491 [2018-01-25 05:40:08,134 INFO L226 Difference]: Without dead ends: 487 [2018-01-25 05:40:08,134 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:40:08,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-01-25 05:40:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2018-01-25 05:40:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-25 05:40:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-25 05:40:08,172 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-25 05:40:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:08,173 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-25 05:40:08,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:40:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-25 05:40:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:40:08,174 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:08,174 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:40:08,174 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:40:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-25 05:40:08,175 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:08,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:08,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:08,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:08,176 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:08,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:40:08,235 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:40:08,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:40:08,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:40:08,236 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:08,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:40:08,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:40:08,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:40:08,237 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-25 05:40:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:08,386 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-25 05:40:08,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:40:08,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-25 05:40:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:08,393 INFO L225 Difference]: With dead ends: 1316 [2018-01-25 05:40:08,393 INFO L226 Difference]: Without dead ends: 861 [2018-01-25 05:40:08,396 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:40:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-25 05:40:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-25 05:40:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-25 05:40:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-25 05:40:08,460 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-25 05:40:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:08,461 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-25 05:40:08,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:40:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-25 05:40:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:40:08,462 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:08,463 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:40:08,463 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:40:08,463 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-25 05:40:08,463 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:08,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:08,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:08,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:08,465 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:08,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:08,560 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:40:08,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:40:08,560 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:40:08,561 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 05:40:08,563 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:40:08,629 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:40:08,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:40:08,843 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 05:40:08,845 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:40:08,854 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 05:40:08,980 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 82.63% of their original sizes. [2018-01-25 05:40:08,981 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 05:40:09,015 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 05:40:09,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:40:09,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-25 05:40:09,016 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:09,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:40:09,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:40:09,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:40:09,017 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-01-25 05:40:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:11,553 INFO L93 Difference]: Finished difference Result 1710 states and 2487 transitions. [2018-01-25 05:40:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:40:11,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 05:40:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:11,559 INFO L225 Difference]: With dead ends: 1710 [2018-01-25 05:40:11,559 INFO L226 Difference]: Without dead ends: 887 [2018-01-25 05:40:11,562 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:40:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-01-25 05:40:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 864. [2018-01-25 05:40:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-01-25 05:40:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1256 transitions. [2018-01-25 05:40:11,626 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1256 transitions. Word has length 26 [2018-01-25 05:40:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:11,627 INFO L432 AbstractCegarLoop]: Abstraction has 864 states and 1256 transitions. [2018-01-25 05:40:11,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:40:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1256 transitions. [2018-01-25 05:40:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:40:11,628 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:11,628 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:40:11,629 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:40:11,629 INFO L82 PathProgramCache]: Analyzing trace with hash -938176756, now seen corresponding path program 1 times [2018-01-25 05:40:11,629 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:11,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:11,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:11,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:11,630 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:11,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:11,717 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:40:11,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:40:11,717 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:40:11,717 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 05:40:11,718 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:40:11,719 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:40:11,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:40:11,917 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:40:11,917 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:40:11,932 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:40:11,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:40:11,933 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:40:11,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:11,945 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:40:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:12,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:40:12,131 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:40:12,131 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:40:12,325 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:40:12,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:40:12,374 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:40:12,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:12,379 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:40:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:12,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:40:12,502 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:40:12,502 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:40:12,720 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:40:12,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:40:12,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9, 6, 6] total 15 [2018-01-25 05:40:12,724 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:40:12,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:40:12,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:40:12,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:40:12,726 INFO L87 Difference]: Start difference. First operand 864 states and 1256 transitions. Second operand 10 states. [2018-01-25 05:40:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:13,887 INFO L93 Difference]: Finished difference Result 2609 states and 4001 transitions. [2018-01-25 05:40:13,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 05:40:13,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-25 05:40:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:13,900 INFO L225 Difference]: With dead ends: 2609 [2018-01-25 05:40:13,900 INFO L226 Difference]: Without dead ends: 1786 [2018-01-25 05:40:13,904 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:40:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-01-25 05:40:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1584. [2018-01-25 05:40:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2018-01-25 05:40:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2296 transitions. [2018-01-25 05:40:14,047 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2296 transitions. Word has length 26 [2018-01-25 05:40:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:14,047 INFO L432 AbstractCegarLoop]: Abstraction has 1584 states and 2296 transitions. [2018-01-25 05:40:14,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:40:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2296 transitions. [2018-01-25 05:40:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:40:14,048 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:14,049 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:40:14,049 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:40:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-01-25 05:40:14,049 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:14,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:14,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:14,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:14,050 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:14,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:40:14,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:40:14,245 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:40:14,245 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 05:40:14,245 INFO L201 CegarAbsIntRunner]: [2], [4], [9], [13], [15], [18], [29], [33], [47], [49], [50], [53], [54], [55], [56], [59], [97], [146], [147], [151], [152], [155], [156], [157] [2018-01-25 05:40:14,246 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:40:14,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:40:59,250 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:40:59,250 INFO L268 AbstractInterpreter]: Visited 24 different actions 43 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-01-25 05:40:59,255 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:40:59,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:40:59,255 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-25 05:40:59,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:59,260 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:40:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:59,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:40:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:40:59,313 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:40:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:40:59,384 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:40:59,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 12 [2018-01-25 05:40:59,385 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:59,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:40:59,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:40:59,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:40:59,385 INFO L87 Difference]: Start difference. First operand 1584 states and 2296 transitions. Second operand 5 states. [2018-01-25 05:40:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:40:59,626 INFO L93 Difference]: Finished difference Result 3928 states and 5820 transitions. [2018-01-25 05:40:59,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:40:59,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-25 05:40:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:40:59,636 INFO L225 Difference]: With dead ends: 3928 [2018-01-25 05:40:59,636 INFO L226 Difference]: Without dead ends: 2340 [2018-01-25 05:40:59,639 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:40:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2018-01-25 05:40:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2322. [2018-01-25 05:40:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2018-01-25 05:40:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3482 transitions. [2018-01-25 05:40:59,737 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3482 transitions. Word has length 27 [2018-01-25 05:40:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:40:59,738 INFO L432 AbstractCegarLoop]: Abstraction has 2322 states and 3482 transitions. [2018-01-25 05:40:59,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:40:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3482 transitions. [2018-01-25 05:40:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:40:59,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:40:59,739 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:40:59,739 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:40:59,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1355764439, now seen corresponding path program 1 times [2018-01-25 05:40:59,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:40:59,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:59,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:40:59,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:40:59,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:40:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:40:59,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:40:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:40:59,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:40:59,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:40:59,854 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:40:59,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:40:59,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:40:59,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:40:59,855 INFO L87 Difference]: Start difference. First operand 2322 states and 3482 transitions. Second operand 7 states. [2018-01-25 05:41:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:41:00,427 INFO L93 Difference]: Finished difference Result 3183 states and 4598 transitions. [2018-01-25 05:41:00,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:41:00,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-25 05:41:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:41:00,430 INFO L225 Difference]: With dead ends: 3183 [2018-01-25 05:41:00,430 INFO L226 Difference]: Without dead ends: 737 [2018-01-25 05:41:00,434 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:41:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-01-25 05:41:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 678. [2018-01-25 05:41:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-01-25 05:41:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 913 transitions. [2018-01-25 05:41:00,465 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 913 transitions. Word has length 31 [2018-01-25 05:41:00,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:41:00,465 INFO L432 AbstractCegarLoop]: Abstraction has 678 states and 913 transitions. [2018-01-25 05:41:00,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:41:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 913 transitions. [2018-01-25 05:41:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:41:00,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:41:00,467 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:41:00,467 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:41:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash 38071788, now seen corresponding path program 1 times [2018-01-25 05:41:00,467 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:41:00,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:41:00,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:41:00,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:41:00,468 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:41:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:41:00,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-25 05:41:00,487 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-25 05:41:00,490 INFO L168 Benchmark]: Toolchain (without parser) took 55067.99 ms. Allocated memory was 287.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 246.2 MB in the beginning and 1.1 GB in the end (delta: -856.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-25 05:41:00,491 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 287.3 MB. Free memory is still 252.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:41:00,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.77 ms. Allocated memory is still 287.3 MB. Free memory was 246.2 MB in the beginning and 234.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:41:00,491 INFO L168 Benchmark]: Boogie Preprocessor took 41.02 ms. Allocated memory is still 287.3 MB. Free memory was 234.3 MB in the beginning and 232.3 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:41:00,491 INFO L168 Benchmark]: RCFGBuilder took 441.60 ms. Allocated memory is still 287.3 MB. Free memory was 232.3 MB in the beginning and 207.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:41:00,492 INFO L168 Benchmark]: TraceAbstraction took 54350.44 ms. Allocated memory was 287.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 207.3 MB in the beginning and 1.1 GB in the end (delta: -895.6 MB). Peak memory consumption was 995.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:41:00,493 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 287.3 MB. Free memory is still 252.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.77 ms. Allocated memory is still 287.3 MB. Free memory was 246.2 MB in the beginning and 234.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.02 ms. Allocated memory is still 287.3 MB. Free memory was 234.3 MB in the beginning and 232.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 441.60 ms. Allocated memory is still 287.3 MB. Free memory was 232.3 MB in the beginning and 207.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54350.44 ms. Allocated memory was 287.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 207.3 MB in the beginning and 1.1 GB in the end (delta: -895.6 MB). Peak memory consumption was 995.0 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 : 96 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 16 TransStat_MAX_NO_DISJUNCTIONS : 5 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.112044 RENAME_VARIABLES(MILLISECONDS) : 0.311787 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.034551 PROJECTAWAY(MILLISECONDS) : 0.085704 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.399976 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.359537 ADD_EQUALITY(MILLISECONDS) : 0.041634 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014555 #CONJOIN_DISJUNCTIVE : 15 #RENAME_VARIABLES : 27 #UNFREEZE : 0 #CONJOIN : 109 #PROJECTAWAY : 26 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 23 #ADD_EQUALITY : 93 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - 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 : 144 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 5 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.799107 RENAME_VARIABLES(MILLISECONDS) : 0.104774 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.762478 PROJECTAWAY(MILLISECONDS) : 0.106780 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.295221 DISJOIN(MILLISECONDS) : 0.217452 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.128116 ADD_EQUALITY(MILLISECONDS) : 0.019783 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.022327 #CONJOIN_DISJUNCTIVE : 85 #RENAME_VARIABLES : 179 #UNFREEZE : 0 #CONJOIN : 261 #PROJECTAWAY : 113 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 24 #RENAME_VARIABLES_DISJUNCTIVE : 155 #ADD_EQUALITY : 140 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 20 LocStat_MAX_SIZEOF_WEQEDGELABEL : 8 LocStat_NO_SUPPORTING_EQUALITIES : 544 LocStat_NO_SUPPORTING_DISEQUALITIES : 40 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 14 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 156 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 36 TransStat_MAX_NO_DISJUNCTIONS : 5 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 416.207894 RENAME_VARIABLES(MILLISECONDS) : 0.002876 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 415.148760 PROJECTAWAY(MILLISECONDS) : 2979.796418 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.057810 DISJOIN(MILLISECONDS) : 0.151526 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.009443 ADD_EQUALITY(MILLISECONDS) : 0.031961 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018493 #CONJOIN_DISJUNCTIVE : 89 #RENAME_VARIABLES : 186 #UNFREEZE : 0 #CONJOIN : 281 #PROJECTAWAY : 128 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 29 #RENAME_VARIABLES_DISJUNCTIVE : 168 #ADD_EQUALITY : 159 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-41-00-504.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-41-00-504.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-41-00-504.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-41-00-504.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-41-00-504.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-41-00-504.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-41-00-504.csv Completed graceful shutdown