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.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:29:29,296 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:29:29,298 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:29:29,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:29:29,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:29:29,314 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:29:29,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:29:29,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:29:29,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:29:29,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:29:29,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:29:29,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:29:29,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:29:29,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:29:29,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:29:29,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:29:29,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:29:29,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:29:29,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:29:29,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:29:29,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:29:29,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:29:29,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:29:29,337 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:29:29,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:29:29,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:29:29,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:29:29,341 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:29:29,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:29:29,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:29:29,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:29:29,343 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.epf [2018-01-24 15:29:29,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:29:29,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:29:29,353 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:29:29,354 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:29:29,354 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:29:29,354 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:29:29,354 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:29:29,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:29:29,355 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:29:29,355 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:29:29,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:29:29,356 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:29:29,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:29:29,356 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:29:29,356 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:29:29,356 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:29:29,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:29:29,357 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:29:29,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:29:29,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:29:29,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:29:29,358 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:29:29,358 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:29:29,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:29:29,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:29:29,358 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:29:29,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:29:29,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:29:29,359 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:29:29,359 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:29:29,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:29:29,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:29:29,360 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:29:29,361 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:29:29,361 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:29:29,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:29:29,405 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:29:29,408 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:29:29,409 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:29:29,409 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:29:29,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-01-24 15:29:29,577 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:29:29,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:29:29,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:29:29,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:29:29,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:29:29,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:29:29" (1/1) ... [2018-01-24 15:29:29,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ddd1bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29, skipping insertion in model container [2018-01-24 15:29:29,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:29:29" (1/1) ... [2018-01-24 15:29:29,608 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:29:29,646 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:29:29,761 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:29:29,782 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:29:29,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29 WrapperNode [2018-01-24 15:29:29,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:29:29,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:29:29,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:29:29,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:29:29,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29" (1/1) ... [2018-01-24 15:29:29,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29" (1/1) ... [2018-01-24 15:29:29,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29" (1/1) ... [2018-01-24 15:29:29,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29" (1/1) ... [2018-01-24 15:29:29,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29" (1/1) ... [2018-01-24 15:29:29,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29" (1/1) ... [2018-01-24 15:29:29,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29" (1/1) ... [2018-01-24 15:29:29,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:29:29,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:29:29,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:29:29,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:29:29,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:29:29,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:29:29,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:29:29,888 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 15:29:29,888 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 15:29:29,888 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:29:29,889 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:29:29,889 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:29:29,889 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:29:29,889 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:29:29,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:29:29,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:29:29,890 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:29:29,890 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:29:29,890 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:29:29,890 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:29:29,890 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 15:29:29,890 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 15:29:29,891 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:29:29,891 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:29:29,891 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:29:30,251 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:29:30,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:29:30 BoogieIcfgContainer [2018-01-24 15:29:30,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:29:30,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:29:30,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:29:30,256 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:29:30,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:29:29" (1/3) ... [2018-01-24 15:29:30,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c4971e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:29:30, skipping insertion in model container [2018-01-24 15:29:30,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:29:29" (2/3) ... [2018-01-24 15:29:30,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c4971e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:29:30, skipping insertion in model container [2018-01-24 15:29:30,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:29:30" (3/3) ... [2018-01-24 15:29:30,260 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-01-24 15:29:30,267 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:29:30,276 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 15:29:30,314 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:29:30,314 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:29:30,315 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:29:30,315 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:29:30,315 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:29:30,315 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:29:30,315 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:29:30,315 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:29:30,316 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:29:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 15:29:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 15:29:30,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:30,339 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:30,340 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:30,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 15:29:30,346 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:30,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:30,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:30,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:30,402 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:30,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:30,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:29:30,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:29:30,523 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:30,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 15:29:30,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 15:29:30,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 15:29:30,540 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 15:29:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:30,649 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 15:29:30,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 15:29:30,650 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 15:29:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:30,660 INFO L225 Difference]: With dead ends: 92 [2018-01-24 15:29:30,660 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 15:29:30,663 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 15:29:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 15:29:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 15:29:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 15:29:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 15:29:30,695 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 15:29:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:30,695 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 15:29:30,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 15:29:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 15:29:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 15:29:30,696 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:30,696 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:30,696 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 15:29:30,697 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:30,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:30,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:30,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:30,699 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:30,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:30,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:29:30,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:29:30,770 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:30,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:29:30,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:29:30,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:29:30,772 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 15:29:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:30,800 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 15:29:30,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:29:30,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 15:29:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:30,802 INFO L225 Difference]: With dead ends: 87 [2018-01-24 15:29:30,802 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 15:29:30,803 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:29:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 15:29:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 15:29:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 15:29:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 15:29:30,812 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 15:29:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:30,812 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 15:29:30,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:29:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 15:29:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 15:29:30,813 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:30,813 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:30,813 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:30,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 15:29:30,813 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:30,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:30,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:30,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:30,815 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:30,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:30,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:29:30,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:29:30,920 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:30,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:29:30,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:29:30,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:29:30,921 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 15:29:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:30,979 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 15:29:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:29:30,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 15:29:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:30,982 INFO L225 Difference]: With dead ends: 145 [2018-01-24 15:29:30,982 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 15:29:30,983 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:29:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 15:29:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 15:29:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 15:29:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 15:29:31,003 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 15:29:31,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:31,004 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 15:29:31,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:29:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 15:29:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:29:31,005 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:31,005 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:31,005 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:31,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 15:29:31,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:31,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:31,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,007 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:31,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:31,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:29:31,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:29:31,060 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:31,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:29:31,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:29:31,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:29:31,061 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 15:29:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:31,154 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 15:29:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:29:31,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 15:29:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:31,156 INFO L225 Difference]: With dead ends: 148 [2018-01-24 15:29:31,157 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 15:29:31,157 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:29:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 15:29:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 15:29:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:29:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 15:29:31,174 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 15:29:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:31,174 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 15:29:31,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:29:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 15:29:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:29:31,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:31,175 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:31,175 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:31,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 15:29:31,176 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:31,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:31,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,177 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:31,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:31,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:29:31,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:29:31,255 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:31,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:29:31,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:29:31,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:29:31,256 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 15:29:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:31,371 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 15:29:31,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:29:31,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 15:29:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:31,375 INFO L225 Difference]: With dead ends: 385 [2018-01-24 15:29:31,375 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 15:29:31,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:29:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 15:29:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 15:29:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 15:29:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 15:29:31,401 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 15:29:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:31,402 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 15:29:31,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:29:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 15:29:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:29:31,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:31,403 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:31,403 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:31,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 15:29:31,403 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:31,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:31,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,405 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:31,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:31,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:29:31,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:29:31,456 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:31,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:29:31,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:29:31,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:29:31,457 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 15:29:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:31,619 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-24 15:29:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:29:31,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 15:29:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:31,624 INFO L225 Difference]: With dead ends: 390 [2018-01-24 15:29:31,624 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 15:29:31,625 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:29:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 15:29:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-24 15:29:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 15:29:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 15:29:31,655 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 15:29:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:31,655 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 15:29:31,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:29:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 15:29:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:29:31,656 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:31,656 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:31,657 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:31,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 15:29:31,657 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:31,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:31,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,658 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:31,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:31,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:29:31,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:29:31,763 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:31,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:29:31,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:29:31,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:29:31,764 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 15:29:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:31,937 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-24 15:29:31,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:29:31,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 15:29:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:31,946 INFO L225 Difference]: With dead ends: 489 [2018-01-24 15:29:31,946 INFO L226 Difference]: Without dead ends: 485 [2018-01-24 15:29:31,947 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:29:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-24 15:29:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-24 15:29:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 15:29:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 15:29:31,980 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 15:29:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:31,981 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 15:29:31,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:29:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 15:29:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:29:31,982 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:31,983 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:31,983 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:31,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 15:29:31,983 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:31,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:31,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:31,985 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:32,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:32,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:29:32,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:29:32,064 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:32,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:29:32,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:29:32,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:29:32,065 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 15:29:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:32,188 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 15:29:32,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:29:32,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 15:29:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:32,196 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 15:29:32,196 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 15:29:32,199 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:29:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 15:29:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 15:29:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 15:29:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 15:29:32,265 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 15:29:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:32,266 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 15:29:32,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:29:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 15:29:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:29:32,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:32,268 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:32,268 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:32,268 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 15:29:32,268 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:32,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:32,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:32,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:32,270 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:32,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:32,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:32,352 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:29:32,353 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 15:29:32,355 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [15], [21], [98], [101], [102], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-24 15:29:32,422 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:29:32,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:29:32,629 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 15:29:32,630 INFO L268 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 39 variables. [2018-01-24 15:29:32,637 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 15:29:32,759 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 82.63% of their original sizes. [2018-01-24 15:29:32,759 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 15:29:32,796 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 15:29:32,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:29:32,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-24 15:29:32,797 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:32,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:29:32,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:29:32,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:29:32,798 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-01-24 15:29:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:35,387 INFO L93 Difference]: Finished difference Result 1710 states and 2487 transitions. [2018-01-24 15:29:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:29:35,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 15:29:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:35,396 INFO L225 Difference]: With dead ends: 1710 [2018-01-24 15:29:35,396 INFO L226 Difference]: Without dead ends: 887 [2018-01-24 15:29:35,400 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:29:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-01-24 15:29:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 864. [2018-01-24 15:29:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-01-24 15:29:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1256 transitions. [2018-01-24 15:29:35,464 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1256 transitions. Word has length 26 [2018-01-24 15:29:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:35,464 INFO L432 AbstractCegarLoop]: Abstraction has 864 states and 1256 transitions. [2018-01-24 15:29:35,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:29:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1256 transitions. [2018-01-24 15:29:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:29:35,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:35,466 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-24 15:29:35,466 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash -938176756, now seen corresponding path program 1 times [2018-01-24 15:29:35,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:35,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:35,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:35,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:35,468 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:35,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:35,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:35,625 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:29:35,625 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 15:29:35,625 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-24 15:29:35,627 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:29:35,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:29:35,784 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:29:35,785 INFO L268 AbstractInterpreter]: Visited 20 different actions 32 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 39 variables. [2018-01-24 15:29:35,789 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:29:35,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:35,789 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:29:35,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:35,805 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:29:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:35,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:29:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:36,075 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:29:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:36,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:36,407 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:29:36,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:36,416 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:29:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:36,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:29:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:36,604 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:29:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:36,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:29:36,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 6, 6] total 17 [2018-01-24 15:29:36,717 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:29:36,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:29:36,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:29:36,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:29:36,718 INFO L87 Difference]: Start difference. First operand 864 states and 1256 transitions. Second operand 13 states. [2018-01-24 15:29:37,391 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 20 DAG size of output 20 [2018-01-24 15:29:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:41,809 INFO L93 Difference]: Finished difference Result 5030 states and 8073 transitions. [2018-01-24 15:29:41,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-01-24 15:29:41,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-01-24 15:29:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:41,830 INFO L225 Difference]: With dead ends: 5030 [2018-01-24 15:29:41,830 INFO L226 Difference]: Without dead ends: 4207 [2018-01-24 15:29:41,837 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2972 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1434, Invalid=6756, Unknown=0, NotChecked=0, Total=8190 [2018-01-24 15:29:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2018-01-24 15:29:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 3116. [2018-01-24 15:29:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2018-01-24 15:29:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4429 transitions. [2018-01-24 15:29:42,022 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4429 transitions. Word has length 26 [2018-01-24 15:29:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:42,022 INFO L432 AbstractCegarLoop]: Abstraction has 3116 states and 4429 transitions. [2018-01-24 15:29:42,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:29:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4429 transitions. [2018-01-24 15:29:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:29:42,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:42,024 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:42,024 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-01-24 15:29:42,025 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:42,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:42,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:42,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:42,026 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:42,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:42,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:42,154 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:29:42,155 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 15:29:42,155 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-24 15:29:42,156 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:29:42,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 15:30:14,843 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 15:30:14,843 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 15:30:14,844 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:30:14,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:30:14,844 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:30:14,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:30:14,849 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:30:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:30:14,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:30:14,897 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 15:30:14,897 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:30:14,902 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:30:14,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:30:14 BoogieIcfgContainer [2018-01-24 15:30:14,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:30:14,904 INFO L168 Benchmark]: Toolchain (without parser) took 45326.30 ms. Allocated memory was 303.6 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 263.5 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 461.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:30:14,904 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 303.6 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:30:14,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.29 ms. Allocated memory is still 303.6 MB. Free memory was 262.4 MB in the beginning and 251.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:30:14,905 INFO L168 Benchmark]: Boogie Preprocessor took 44.00 ms. Allocated memory is still 303.6 MB. Free memory was 251.5 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:30:14,905 INFO L168 Benchmark]: RCFGBuilder took 414.58 ms. Allocated memory is still 303.6 MB. Free memory was 249.4 MB in the beginning and 223.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:30:14,906 INFO L168 Benchmark]: TraceAbstraction took 44649.32 ms. Allocated memory was 303.6 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 223.4 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 421.5 MB. Max. memory is 5.3 GB. [2018-01-24 15:30:14,907 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.19 ms. Allocated memory is still 303.6 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.29 ms. Allocated memory is still 303.6 MB. Free memory was 262.4 MB in the beginning and 251.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.00 ms. Allocated memory is still 303.6 MB. Free memory was 251.5 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 414.58 ms. Allocated memory is still 303.6 MB. Free memory was 249.4 MB in the beginning and 223.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44649.32 ms. Allocated memory was 303.6 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 223.4 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 421.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 7 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 175 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -14 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 12 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 94 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 15 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.008669 RENAME_VARIABLES(MILLISECONDS) : 0.197830 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.924403 PROJECTAWAY(MILLISECONDS) : 0.050796 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.064867 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.239127 ADD_EQUALITY(MILLISECONDS) : 0.043081 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013678 #CONJOIN_DISJUNCTIVE : 15 #RENAME_VARIABLES : 26 #UNFREEZE : 0 #CONJOIN : 106 #PROJECTAWAY : 25 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 23 #ADD_EQUALITY : 92 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 407 LocStat_NO_SUPPORTING_DISEQUALITIES : 4 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 142 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.403475 RENAME_VARIABLES(MILLISECONDS) : 0.135828 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.365779 PROJECTAWAY(MILLISECONDS) : 0.109120 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.226238 DISJOIN(MILLISECONDS) : 0.265377 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.161720 ADD_EQUALITY(MILLISECONDS) : 0.038829 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.023531 #CONJOIN_DISJUNCTIVE : 61 #RENAME_VARIABLES : 108 #UNFREEZE : 0 #CONJOIN : 210 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 93 #ADD_EQUALITY : 139 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 * 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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 28 with TraceHistMax 2, 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, 44.5s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 935 SDtfs, 1826 SDslu, 1602 SDs, 0 SdLazy, 1171 SolverSat, 545 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 247 GetRequests, 128 SyntacticMatches, 8 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2974 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3116occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 33.1s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9787581699346404 AbsIntWeakeningRatio, 1.08 AbsIntAvgWeakeningVarsNumRemoved, 9.28 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1255 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 14189 SizeOfPredicates, 10 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 28/48 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.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-30-14-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-30-14-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-30-14-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-30-14-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-30-14-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-30-14-920.csv Completed graceful shutdown