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.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:37:16,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:37:16,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:37:16,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:37:16,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:37:16,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:37:16,689 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:37:16,691 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:37:16,693 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:37:16,693 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:37:16,694 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:37:16,694 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:37:16,695 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:37:16,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:37:16,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:37:16,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:37:16,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:37:16,703 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:37:16,704 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:37:16,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:37:16,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:37:16,709 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:37:16,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:37:16,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:37:16,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:37:16,712 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:37:16,712 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:37:16,713 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:37:16,713 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:37:16,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:37:16,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:37:16,715 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:37:16,724 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:37:16,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:37:16,725 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:37:16,726 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:37:16,726 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:37:16,726 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:37:16,726 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:37:16,726 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:37:16,727 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:37:16,727 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:37:16,728 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:37:16,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:37:16,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:37:16,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:37:16,728 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:37:16,729 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:37:16,729 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:37:16,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:37:16,729 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:37:16,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:37:16,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:37:16,730 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:37:16,730 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:37:16,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:37:16,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:37:16,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:37:16,731 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:37:16,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:37:16,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:37:16,732 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:37:16,732 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:37:16,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:37:16,732 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:37:16,732 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:37:16,733 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:37:16,733 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:37:16,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:37:16,785 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:37:16,789 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:37:16,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:37:16,791 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:37:16,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-01-25 05:37:16,986 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:37:16,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:37:16,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:37:16,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:37:16,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:37:16,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:37:16" (1/1) ... [2018-01-25 05:37:17,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d56f953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:16, skipping insertion in model container [2018-01-25 05:37:17,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:37:16" (1/1) ... [2018-01-25 05:37:17,013 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:37:17,052 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:37:17,177 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:37:17,203 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:37:17,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17 WrapperNode [2018-01-25 05:37:17,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:37:17,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:37:17,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:37:17,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:37:17,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17" (1/1) ... [2018-01-25 05:37:17,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17" (1/1) ... [2018-01-25 05:37:17,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17" (1/1) ... [2018-01-25 05:37:17,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17" (1/1) ... [2018-01-25 05:37:17,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17" (1/1) ... [2018-01-25 05:37:17,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17" (1/1) ... [2018-01-25 05:37:17,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17" (1/1) ... [2018-01-25 05:37:17,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:37:17,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:37:17,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:37:17,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:37:17,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17" (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:37:17,304 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:37:17,305 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:37:17,305 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-25 05:37:17,305 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-25 05:37:17,305 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:37:17,305 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:37:17,305 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:37:17,305 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:37:17,305 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:37:17,305 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:37:17,306 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:37:17,306 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:37:17,306 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:37:17,306 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:37:17,306 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:37:17,306 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-25 05:37:17,306 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-25 05:37:17,306 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:37:17,307 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:37:17,307 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:37:17,647 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:37:17,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:37:17 BoogieIcfgContainer [2018-01-25 05:37:17,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:37:17,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:37:17,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:37:17,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:37:17,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:37:16" (1/3) ... [2018-01-25 05:37:17,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14772ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:37:17, skipping insertion in model container [2018-01-25 05:37:17,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:37:17" (2/3) ... [2018-01-25 05:37:17,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14772ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:37:17, skipping insertion in model container [2018-01-25 05:37:17,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:37:17" (3/3) ... [2018-01-25 05:37:17,655 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-01-25 05:37:17,662 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:37:17,670 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-25 05:37:17,706 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:37:17,706 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:37:17,707 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:37:17,707 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:37:17,707 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:37:17,707 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:37:17,707 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:37:17,707 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:37:17,708 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:37:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-25 05:37:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 05:37:17,730 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:17,731 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:37:17,731 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:37:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-25 05:37:17,736 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:17,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:17,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:17,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:17,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:17,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:17,888 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:37:17,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:37:17,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:37:17,891 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:17,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:37:17,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:37:17,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:37:17,914 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-25 05:37:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:18,031 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-25 05:37:18,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:37:18,033 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-25 05:37:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:18,048 INFO L225 Difference]: With dead ends: 92 [2018-01-25 05:37:18,048 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:37:18,051 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:37:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:37:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 05:37:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 05:37:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-25 05:37:18,088 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-25 05:37:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:18,088 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-25 05:37:18,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:37:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-25 05:37:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:37:18,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:18,089 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:37:18,089 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:37:18,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-25 05:37:18,090 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:18,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:18,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,091 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:18,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:18,157 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:37:18,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:37:18,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:37:18,158 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:18,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:37:18,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:37:18,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:37:18,160 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-25 05:37:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:18,192 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-25 05:37:18,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:37:18,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:37:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:18,195 INFO L225 Difference]: With dead ends: 87 [2018-01-25 05:37:18,195 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 05:37:18,196 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:37:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 05:37:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-25 05:37:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 05:37:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-25 05:37:18,206 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-25 05:37:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:18,206 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-25 05:37:18,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:37:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-25 05:37:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:37:18,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:18,207 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:37:18,208 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:37:18,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-25 05:37:18,208 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:18,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:18,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,209 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:18,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:18,307 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:37:18,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:37:18,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:37:18,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:18,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:37:18,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:37:18,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:37:18,308 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-25 05:37:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:18,362 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-25 05:37:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:37:18,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:37:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:18,364 INFO L225 Difference]: With dead ends: 145 [2018-01-25 05:37:18,365 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 05:37:18,365 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:37:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 05:37:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-25 05:37:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 05:37:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-25 05:37:18,385 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-25 05:37:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:18,385 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-25 05:37:18,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:37:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-25 05:37:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:37:18,386 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:18,386 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:37:18,387 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:37:18,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-25 05:37:18,387 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:18,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:18,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,388 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:18,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:18,438 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:37:18,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:37:18,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:37:18,439 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:18,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:37:18,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:37:18,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:37:18,440 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-25 05:37:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:18,520 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-25 05:37:18,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:37:18,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-25 05:37:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:18,522 INFO L225 Difference]: With dead ends: 148 [2018-01-25 05:37:18,522 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 05:37:18,522 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:37:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 05:37:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-25 05:37:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 05:37:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-25 05:37:18,537 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-25 05:37:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:18,538 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-25 05:37:18,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:37:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-25 05:37:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:37:18,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:18,538 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:37:18,538 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:37:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-25 05:37:18,539 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:18,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:18,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:18,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:18,604 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:37:18,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:37:18,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:37:18,604 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:18,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:37:18,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:37:18,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:37:18,605 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-25 05:37:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:18,721 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-25 05:37:18,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:37:18,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 05:37:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:18,725 INFO L225 Difference]: With dead ends: 385 [2018-01-25 05:37:18,725 INFO L226 Difference]: Without dead ends: 255 [2018-01-25 05:37:18,727 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:37:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-25 05:37:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-25 05:37:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-25 05:37:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-25 05:37:18,757 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-25 05:37:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:18,757 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-25 05:37:18,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:37:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-25 05:37:18,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:37:18,758 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:18,758 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:37:18,758 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:37:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-25 05:37:18,759 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:18,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:18,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,760 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:18,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:18,805 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:37:18,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:37:18,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:37:18,805 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:18,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:37:18,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:37:18,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:37:18,806 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-25 05:37:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:18,936 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-25 05:37:18,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:37:18,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 05:37:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:18,939 INFO L225 Difference]: With dead ends: 390 [2018-01-25 05:37:18,939 INFO L226 Difference]: Without dead ends: 386 [2018-01-25 05:37:18,940 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:37:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-25 05:37:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-25 05:37:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-25 05:37:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-25 05:37:18,971 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-25 05:37:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:18,971 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-25 05:37:18,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:37:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-25 05:37:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:37:18,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:18,972 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:37:18,972 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:37:18,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-25 05:37:18,973 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:18,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:18,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:18,974 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:18,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:19,046 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:37:19,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:37:19,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:37:19,047 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:19,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:37:19,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:37:19,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:37:19,048 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-25 05:37:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:19,407 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-25 05:37:19,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:37:19,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 05:37:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:19,412 INFO L225 Difference]: With dead ends: 489 [2018-01-25 05:37:19,413 INFO L226 Difference]: Without dead ends: 485 [2018-01-25 05:37:19,413 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:37:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-25 05:37:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-25 05:37:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-25 05:37:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-25 05:37:19,445 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-25 05:37:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:19,445 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-25 05:37:19,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:37:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-25 05:37:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:37:19,447 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:19,447 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:37:19,447 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:37:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-25 05:37:19,448 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:19,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:19,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:19,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:19,449 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:19,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:19,521 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:37:19,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:37:19,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:37:19,522 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:19,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:37:19,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:37:19,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:37:19,523 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-25 05:37:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:19,605 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-25 05:37:19,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:37:19,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-25 05:37:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:19,612 INFO L225 Difference]: With dead ends: 1316 [2018-01-25 05:37:19,612 INFO L226 Difference]: Without dead ends: 861 [2018-01-25 05:37:19,614 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:37:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-25 05:37:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-25 05:37:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-25 05:37:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-25 05:37:19,658 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-25 05:37:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:19,659 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-25 05:37:19,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:37:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-25 05:37:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:37:19,660 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:19,660 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:37:19,661 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:37:19,661 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-25 05:37:19,661 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:19,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:19,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:19,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:19,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:19,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:19,732 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:37:19,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:19,732 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:37:19,733 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 05:37:19,734 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:37:19,779 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:37:19,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:37:19,965 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 05:37:19,966 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:37:19,978 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 05:37:20,091 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.81% of their original sizes. [2018-01-25 05:37:20,092 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 05:37:20,127 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 05:37:20,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:37:20,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-25 05:37:20,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:20,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:37:20,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:37:20,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:37:20,130 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-01-25 05:37:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:22,821 INFO L93 Difference]: Finished difference Result 1710 states and 2487 transitions. [2018-01-25 05:37:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:37:22,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 05:37:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:22,825 INFO L225 Difference]: With dead ends: 1710 [2018-01-25 05:37:22,826 INFO L226 Difference]: Without dead ends: 887 [2018-01-25 05:37:22,828 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:37:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-01-25 05:37:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 864. [2018-01-25 05:37:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-01-25 05:37:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1256 transitions. [2018-01-25 05:37:22,879 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1256 transitions. Word has length 26 [2018-01-25 05:37:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:22,879 INFO L432 AbstractCegarLoop]: Abstraction has 864 states and 1256 transitions. [2018-01-25 05:37:22,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:37:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1256 transitions. [2018-01-25 05:37:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:37:22,881 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:22,881 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:37:22,881 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:37:22,881 INFO L82 PathProgramCache]: Analyzing trace with hash -938176756, now seen corresponding path program 1 times [2018-01-25 05:37:22,881 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:22,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:22,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:22,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:22,883 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:22,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:22,994 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:37:22,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:22,995 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:37:22,995 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 05:37:22,995 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:37:22,996 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:37:22,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:37:23,161 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:37:23,162 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:37:23,173 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:37:23,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:23,174 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:37:23,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:23,188 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:37:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:23,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:37:23,534 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:37:23,534 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:37:24,002 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:37:24,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:24,025 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:37:24,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:24,038 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:37:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:24,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:37:24,152 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:37:24,153 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:37:24,268 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:37:24,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:37:24,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9, 6, 6] total 15 [2018-01-25 05:37:24,272 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:37:24,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:37:24,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:37:24,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:37:24,273 INFO L87 Difference]: Start difference. First operand 864 states and 1256 transitions. Second operand 10 states. [2018-01-25 05:37:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:25,368 INFO L93 Difference]: Finished difference Result 2609 states and 4001 transitions. [2018-01-25 05:37:25,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 05:37:25,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-25 05:37:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:25,377 INFO L225 Difference]: With dead ends: 2609 [2018-01-25 05:37:25,377 INFO L226 Difference]: Without dead ends: 1786 [2018-01-25 05:37:25,380 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:37:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-01-25 05:37:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1584. [2018-01-25 05:37:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2018-01-25 05:37:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2296 transitions. [2018-01-25 05:37:25,458 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2296 transitions. Word has length 26 [2018-01-25 05:37:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:25,458 INFO L432 AbstractCegarLoop]: Abstraction has 1584 states and 2296 transitions. [2018-01-25 05:37:25,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:37:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2296 transitions. [2018-01-25 05:37:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:37:25,460 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:25,460 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:37:25,460 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:37:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-01-25 05:37:25,460 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:25,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:25,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:25,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:25,462 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:25,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:25,645 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:37:25,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:25,646 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:37:25,646 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 05:37:25,646 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:37:25,647 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:37:25,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:37:47,333 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:37:47,333 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:37:47,338 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:37:47,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:47,338 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:37:47,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:47,347 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:37:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:47,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:37:47,422 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:37:47,422 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:37:47,475 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:37:47,508 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:37:47,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 12 [2018-01-25 05:37:47,508 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:47,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:37:47,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:37:47,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:37:47,509 INFO L87 Difference]: Start difference. First operand 1584 states and 2296 transitions. Second operand 5 states. [2018-01-25 05:37:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:47,789 INFO L93 Difference]: Finished difference Result 3928 states and 5820 transitions. [2018-01-25 05:37:47,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:37:47,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-25 05:37:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:47,798 INFO L225 Difference]: With dead ends: 3928 [2018-01-25 05:37:47,798 INFO L226 Difference]: Without dead ends: 2340 [2018-01-25 05:37:47,802 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:37:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2018-01-25 05:37:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2322. [2018-01-25 05:37:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2018-01-25 05:37:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3482 transitions. [2018-01-25 05:37:47,894 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3482 transitions. Word has length 27 [2018-01-25 05:37:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:47,894 INFO L432 AbstractCegarLoop]: Abstraction has 2322 states and 3482 transitions. [2018-01-25 05:37:47,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:37:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3482 transitions. [2018-01-25 05:37:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:37:47,895 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:47,895 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:37:47,895 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:37:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1355764439, now seen corresponding path program 1 times [2018-01-25 05:37:47,896 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:47,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:47,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:47,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:47,897 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:47,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:48,026 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:37:48,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:37:48,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:37:48,026 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:37:48,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:37:48,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:37:48,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:37:48,027 INFO L87 Difference]: Start difference. First operand 2322 states and 3482 transitions. Second operand 7 states. [2018-01-25 05:37:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:48,803 INFO L93 Difference]: Finished difference Result 3183 states and 4598 transitions. [2018-01-25 05:37:48,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:37:48,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-25 05:37:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:48,806 INFO L225 Difference]: With dead ends: 3183 [2018-01-25 05:37:48,806 INFO L226 Difference]: Without dead ends: 737 [2018-01-25 05:37:48,810 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:37:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-01-25 05:37:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 678. [2018-01-25 05:37:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-01-25 05:37:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 913 transitions. [2018-01-25 05:37:48,838 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 913 transitions. Word has length 31 [2018-01-25 05:37:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:48,839 INFO L432 AbstractCegarLoop]: Abstraction has 678 states and 913 transitions. [2018-01-25 05:37:48,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:37:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 913 transitions. [2018-01-25 05:37:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:37:48,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:48,840 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:37:48,840 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:37:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash 38071788, now seen corresponding path program 1 times [2018-01-25 05:37:48,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:48,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:48,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:48,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:48,841 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:48,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:37:49,074 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:49,074 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:37:49,074 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 05:37:49,074 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [15], [21], [98], [101], [102], [105], [110], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-25 05:37:49,075 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:37:49,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:37:49,174 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:37:49,174 INFO L268 AbstractInterpreter]: Visited 22 different actions 47 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:37:49,177 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:37:49,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:49,177 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:37:49,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:49,192 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:37:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:49,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:37:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:37:49,600 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:37:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:37:49,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:49,905 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:37:49,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:49,914 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:37:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:50,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:37:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:37:50,101 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:37:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:37:50,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:37:50,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 13 [2018-01-25 05:37:50,206 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:37:50,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:37:50,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:37:50,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:37:50,207 INFO L87 Difference]: Start difference. First operand 678 states and 913 transitions. Second operand 10 states. [2018-01-25 05:37:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:50,877 INFO L93 Difference]: Finished difference Result 2902 states and 4079 transitions. [2018-01-25 05:37:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:37:50,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-25 05:37:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:50,890 INFO L225 Difference]: With dead ends: 2902 [2018-01-25 05:37:50,890 INFO L226 Difference]: Without dead ends: 2234 [2018-01-25 05:37:50,893 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 131 SyntacticMatches, 18 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-01-25 05:37:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2018-01-25 05:37:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1960. [2018-01-25 05:37:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2018-01-25 05:37:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2659 transitions. [2018-01-25 05:37:51,018 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2659 transitions. Word has length 38 [2018-01-25 05:37:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:51,018 INFO L432 AbstractCegarLoop]: Abstraction has 1960 states and 2659 transitions. [2018-01-25 05:37:51,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:37:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2659 transitions. [2018-01-25 05:37:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 05:37:51,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:51,020 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:37:51,020 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:37:51,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1056748287, now seen corresponding path program 1 times [2018-01-25 05:37:51,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:51,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:51,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:51,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:51,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:51,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-25 05:37:51,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:51,226 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:37:51,226 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 05:37:51,226 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [15], [21], [98], [101], [102], [112], [115], [117], [120], [130], [142], [144], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-25 05:37:51,227 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:37:51,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:37:51,429 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:37:51,429 INFO L268 AbstractInterpreter]: Visited 24 different actions 55 times. Merged at 9 different actions 13 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 39 variables. [2018-01-25 05:37:51,430 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:37:51,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:51,431 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:37:51,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:51,439 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:37:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:51,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:37:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-25 05:37:51,609 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:37:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:37:51,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:51,796 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 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 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:37:51,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:51,800 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:37:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:51,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:37:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:37:52,020 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:37:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:37:52,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:37:52,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11, 8, 8] total 29 [2018-01-25 05:37:52,179 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:37:52,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 05:37:52,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 05:37:52,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:37:52,181 INFO L87 Difference]: Start difference. First operand 1960 states and 2659 transitions. Second operand 16 states. [2018-01-25 05:37:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:53,191 INFO L93 Difference]: Finished difference Result 3291 states and 4395 transitions. [2018-01-25 05:37:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-25 05:37:53,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-01-25 05:37:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:53,197 INFO L225 Difference]: With dead ends: 3291 [2018-01-25 05:37:53,197 INFO L226 Difference]: Without dead ends: 1287 [2018-01-25 05:37:53,201 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=525, Invalid=2555, Unknown=0, NotChecked=0, Total=3080 [2018-01-25 05:37:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2018-01-25 05:37:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1213. [2018-01-25 05:37:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2018-01-25 05:37:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1523 transitions. [2018-01-25 05:37:53,245 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1523 transitions. Word has length 41 [2018-01-25 05:37:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:53,246 INFO L432 AbstractCegarLoop]: Abstraction has 1213 states and 1523 transitions. [2018-01-25 05:37:53,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 05:37:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1523 transitions. [2018-01-25 05:37:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-25 05:37:53,246 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:53,247 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:37:53,247 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:37:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash -729807276, now seen corresponding path program 1 times [2018-01-25 05:37:53,247 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:53,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:53,248 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:53,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:53,248 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:53,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-25 05:37:53,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:53,636 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:37:53,636 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-01-25 05:37:53,636 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [13], [15], [18], [21], [29], [33], [47], [49], [50], [53], [54], [55], [56], [59], [62], [69], [73], [80], [90], [93], [97], [98], [101], [102], [105], [108], [145], [146], [147], [151], [152], [153], [154], [155], [156], [157] [2018-01-25 05:37:53,637 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:37:53,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:38:01,236 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:38:01,237 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:38:01,237 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:38:01,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:01,237 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:38:01,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:01,244 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:38:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:01,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:38:01,303 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:38:01,303 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:38:01,307 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:38:01,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:38:01 BoogieIcfgContainer [2018-01-25 05:38:01,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:38:01,309 INFO L168 Benchmark]: Toolchain (without parser) took 44322.12 ms. Allocated memory was 302.5 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 262.4 MB in the beginning and 981.5 MB in the end (delta: -719.1 MB). Peak memory consumption was 915.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:01,309 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 302.5 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:38:01,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.07 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 250.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:01,310 INFO L168 Benchmark]: Boogie Preprocessor took 39.27 ms. Allocated memory is still 302.5 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:01,310 INFO L168 Benchmark]: RCFGBuilder took 395.65 ms. Allocated memory is still 302.5 MB. Free memory was 248.2 MB in the beginning and 222.1 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:01,310 INFO L168 Benchmark]: TraceAbstraction took 43658.71 ms. Allocated memory was 302.5 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 222.1 MB in the beginning and 981.5 MB in the end (delta: -759.5 MB). Peak memory consumption was 874.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:01,312 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.25 ms. Allocated memory is still 302.5 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.07 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 250.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.27 ms. Allocated memory is still 302.5 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 395.65 ms. Allocated memory is still 302.5 MB. Free memory was 248.2 MB in the beginning and 222.1 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43658.71 ms. Allocated memory was 302.5 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 222.1 MB in the beginning and 981.5 MB in the end (delta: -759.5 MB). Peak memory consumption was 874.7 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 : 92 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 14 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.137013 RENAME_VARIABLES(MILLISECONDS) : 0.246436 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.065464 PROJECTAWAY(MILLISECONDS) : 0.061759 ADD_WEAK_EQUALITY(MILLISECONDS) : 3.472438 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.298712 ADD_EQUALITY(MILLISECONDS) : 0.227988 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014866 #CONJOIN_DISJUNCTIVE : 15 #RENAME_VARIABLES : 25 #UNFREEZE : 0 #CONJOIN : 103 #PROJECTAWAY : 24 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 23 #ADD_EQUALITY : 91 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - 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 : 140 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.733955 RENAME_VARIABLES(MILLISECONDS) : 0.087215 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.700467 PROJECTAWAY(MILLISECONDS) : 0.084641 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.172032 DISJOIN(MILLISECONDS) : 0.158424 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.106382 ADD_EQUALITY(MILLISECONDS) : 0.090274 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.030762 #CONJOIN_DISJUNCTIVE : 85 #RENAME_VARIABLES : 175 #UNFREEZE : 0 #CONJOIN : 253 #PROJECTAWAY : 111 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 24 #RENAME_VARIABLES_DISJUNCTIVE : 155 #ADD_EQUALITY : 138 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 20 LocStat_MAX_SIZEOF_WEQEDGELABEL : 6 LocStat_NO_SUPPORTING_EQUALITIES : 535 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 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 : 162 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 307.284911 RENAME_VARIABLES(MILLISECONDS) : 0.002696 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 306.537287 PROJECTAWAY(MILLISECONDS) : 2637.727794 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.052518 DISJOIN(MILLISECONDS) : 0.148155 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.009743 ADD_EQUALITY(MILLISECONDS) : 0.032152 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013074 #CONJOIN_DISJUNCTIVE : 82 #RENAME_VARIABLES : 158 #UNFREEZE : 0 #CONJOIN : 265 #PROJECTAWAY : 113 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 29 #RENAME_VARIABLES_DISJUNCTIVE : 146 #ADD_EQUALITY : 167 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 436 LocStat_NO_SUPPORTING_DISEQUALITIES : 3 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 141 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.622111 RENAME_VARIABLES(MILLISECONDS) : 0.080814 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.593956 PROJECTAWAY(MILLISECONDS) : 0.050472 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.154651 DISJOIN(MILLISECONDS) : 0.102114 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.105090 ADD_EQUALITY(MILLISECONDS) : 0.011521 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010835 #CONJOIN_DISJUNCTIVE : 91 #RENAME_VARIABLES : 189 #UNFREEZE : 0 #CONJOIN : 261 #PROJECTAWAY : 116 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 167 #ADD_EQUALITY : 139 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 483 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 151 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.496515 RENAME_VARIABLES(MILLISECONDS) : 0.003913 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.176419 PROJECTAWAY(MILLISECONDS) : 0.703346 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.144655 DISJOIN(MILLISECONDS) : 0.168099 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.017733 ADD_EQUALITY(MILLISECONDS) : 0.017807 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007226 #CONJOIN_DISJUNCTIVE : 115 #RENAME_VARIABLES : 249 #UNFREEZE : 0 #CONJOIN : 323 #PROJECTAWAY : 161 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 221 #ADD_EQUALITY : 151 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 43.6s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1363 SDtfs, 2435 SDslu, 2422 SDs, 0 SdLazy, 1708 SolverSat, 487 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 648 GetRequests, 483 SyntacticMatches, 24 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2322occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 30.0s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.9787581699346404 AbsIntWeakeningRatio, 1.08 AbsIntAvgWeakeningVarsNumRemoved, 9.44 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 791 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 744 ConstructedInterpolants, 0 QuantifiedInterpolants, 93185 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2476 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 252/344 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-25_05-38-01-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-38-01-326.csv Completed graceful shutdown