java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:38:03,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:38:03,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:38:03,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:38:03,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:38:03,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:38:03,986 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:38:03,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:38:03,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:38:03,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:38:03,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:38:03,992 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:38:03,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:38:03,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:38:03,994 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:38:03,997 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:38:03,999 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:38:04,001 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:38:04,003 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:38:04,004 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:38:04,006 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:38:04,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:38:04,007 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:38:04,008 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:38:04,009 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:38:04,010 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:38:04,010 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:38:04,011 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:38:04,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:38:04,011 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:38:04,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:38:04,013 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:38:04,023 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:38:04,023 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:38:04,024 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:38:04,024 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:38:04,025 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:38:04,025 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:38:04,025 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:38:04,025 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:38:04,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:38:04,026 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:38:04,026 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:38:04,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:38:04,027 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:38:04,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:38:04,027 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:38:04,027 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:38:04,027 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:38:04,028 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:38:04,028 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:38:04,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:38:04,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:38:04,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:38:04,029 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:38:04,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:38:04,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:38:04,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:38:04,030 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:38:04,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:38:04,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:38:04,030 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:38:04,030 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:38:04,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:38:04,031 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:38:04,031 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:38:04,032 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:38:04,032 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:38:04,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:38:04,083 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:38:04,087 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:38:04,089 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:38:04,090 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:38:04,090 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-25 05:38:04,287 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:38:04,293 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:38:04,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:38:04,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:38:04,300 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:38:04,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:38:04" (1/1) ... [2018-01-25 05:38:04,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a76578b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04, skipping insertion in model container [2018-01-25 05:38:04,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:38:04" (1/1) ... [2018-01-25 05:38:04,323 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:38:04,365 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:38:04,486 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:38:04,507 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:38:04,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04 WrapperNode [2018-01-25 05:38:04,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:38:04,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:38:04,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:38:04,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:38:04,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04" (1/1) ... [2018-01-25 05:38:04,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04" (1/1) ... [2018-01-25 05:38:04,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04" (1/1) ... [2018-01-25 05:38:04,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04" (1/1) ... [2018-01-25 05:38:04,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04" (1/1) ... [2018-01-25 05:38:04,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04" (1/1) ... [2018-01-25 05:38:04,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04" (1/1) ... [2018-01-25 05:38:04,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:38:04,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:38:04,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:38:04,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:38:04,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:38:04,610 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:38:04,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:38:04,611 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-25 05:38:04,611 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-25 05:38:04,611 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:38:04,611 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:38:04,611 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:38:04,611 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:38:04,612 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:38:04,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:38:04,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:38:04,612 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:38:04,612 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:38:04,612 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:38:04,613 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:38:04,613 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-25 05:38:04,613 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-25 05:38:04,613 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:38:04,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:38:04,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:38:04,957 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:38:04,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:38:04 BoogieIcfgContainer [2018-01-25 05:38:04,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:38:04,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:38:04,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:38:04,962 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:38:04,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:38:04" (1/3) ... [2018-01-25 05:38:04,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275a65a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:38:04, skipping insertion in model container [2018-01-25 05:38:04,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:04" (2/3) ... [2018-01-25 05:38:04,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275a65a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:38:04, skipping insertion in model container [2018-01-25 05:38:04,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:38:04" (3/3) ... [2018-01-25 05:38:04,967 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-01-25 05:38:04,977 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:38:04,987 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-25 05:38:05,038 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:38:05,038 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:38:05,039 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:38:05,039 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:38:05,039 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:38:05,039 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:38:05,039 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:38:05,039 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:38:05,040 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:38:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-25 05:38:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 05:38:05,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:05,071 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:05,071 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-25 05:38:05,079 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:05,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:05,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,134 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:05,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:05,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:05,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:38:05,255 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:05,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:38:05,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:38:05,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:38:05,276 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-25 05:38:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:05,387 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-25 05:38:05,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:38:05,388 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-25 05:38:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:05,400 INFO L225 Difference]: With dead ends: 92 [2018-01-25 05:38:05,400 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:38:05,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:38:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:38:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 05:38:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 05:38:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-25 05:38:05,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-25 05:38:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:05,442 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-25 05:38:05,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:38:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-25 05:38:05,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:38:05,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:05,443 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:05,443 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:05,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-25 05:38:05,443 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:05,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:05,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,445 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:05,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:05,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:05,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:05,511 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:05,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:38:05,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:38:05,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:05,513 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-25 05:38:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:05,545 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-25 05:38:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:38:05,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:38:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:05,548 INFO L225 Difference]: With dead ends: 87 [2018-01-25 05:38:05,548 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 05:38:05,549 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 05:38:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-25 05:38:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 05:38:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-25 05:38:05,558 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-25 05:38:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:05,559 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-25 05:38:05,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:38:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-25 05:38:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:38:05,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:05,560 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:05,560 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-25 05:38:05,560 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:05,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:05,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,562 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:05,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:05,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:05,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:05,669 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:05,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:38:05,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:38:05,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:05,670 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-25 05:38:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:05,712 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-25 05:38:05,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:38:05,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:38:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:05,715 INFO L225 Difference]: With dead ends: 145 [2018-01-25 05:38:05,715 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 05:38:05,716 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 05:38:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-25 05:38:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 05:38:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-25 05:38:05,735 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-25 05:38:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:05,735 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-25 05:38:05,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:38:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-25 05:38:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:38:05,736 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:05,736 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:05,736 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-25 05:38:05,737 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:05,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:05,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,738 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:05,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:05,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:05,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:38:05,790 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:05,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:38:05,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:38:05,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:05,791 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-25 05:38:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:05,863 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-25 05:38:05,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:38:05,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-25 05:38:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:05,866 INFO L225 Difference]: With dead ends: 148 [2018-01-25 05:38:05,866 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 05:38:05,867 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 05:38:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-25 05:38:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 05:38:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-25 05:38:05,886 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-25 05:38:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:05,887 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-25 05:38:05,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:38:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-25 05:38:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:38:05,888 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:05,888 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:05,888 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-25 05:38:05,889 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:05,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:05,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:05,890 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:05,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:05,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:05,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:38:05,990 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:05,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:38:05,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:38:05,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:38:05,991 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-25 05:38:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:06,097 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-25 05:38:06,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:38:06,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 05:38:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:06,101 INFO L225 Difference]: With dead ends: 385 [2018-01-25 05:38:06,101 INFO L226 Difference]: Without dead ends: 255 [2018-01-25 05:38:06,103 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:38:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-25 05:38:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-25 05:38:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-25 05:38:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-25 05:38:06,132 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-25 05:38:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:06,133 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-25 05:38:06,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:38:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-25 05:38:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:38:06,134 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:06,134 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:06,134 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:06,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-25 05:38:06,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:06,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:06,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,136 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:06,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:06,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:06,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:06,193 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:06,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:38:06,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:38:06,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:38:06,193 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-25 05:38:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:06,351 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-25 05:38:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:38:06,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 05:38:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:06,356 INFO L225 Difference]: With dead ends: 390 [2018-01-25 05:38:06,356 INFO L226 Difference]: Without dead ends: 386 [2018-01-25 05:38:06,357 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:38:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-25 05:38:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-25 05:38:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-25 05:38:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-25 05:38:06,390 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-25 05:38:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:06,391 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-25 05:38:06,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:38:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-25 05:38:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:38:06,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:06,392 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:06,392 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:06,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-25 05:38:06,392 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:06,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:06,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,394 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:06,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:06,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:06,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:06,470 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:06,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:38:06,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:38:06,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:38:06,471 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-25 05:38:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:06,651 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-25 05:38:06,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:38:06,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 05:38:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:06,656 INFO L225 Difference]: With dead ends: 489 [2018-01-25 05:38:06,657 INFO L226 Difference]: Without dead ends: 485 [2018-01-25 05:38:06,657 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:38:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-25 05:38:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-25 05:38:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-25 05:38:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-25 05:38:06,706 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-25 05:38:06,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:06,706 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-25 05:38:06,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:38:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-25 05:38:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:38:06,707 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:06,707 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:06,710 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-25 05:38:06,710 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:06,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:06,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:06,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:06,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:06,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:38:06,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:06,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:38:06,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:38:06,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:38:06,795 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-25 05:38:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:06,911 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-25 05:38:06,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:38:06,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-25 05:38:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:06,919 INFO L225 Difference]: With dead ends: 1316 [2018-01-25 05:38:06,919 INFO L226 Difference]: Without dead ends: 861 [2018-01-25 05:38:06,922 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:38:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-25 05:38:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-25 05:38:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-25 05:38:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-25 05:38:06,982 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-25 05:38:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:06,983 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-25 05:38:06,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:38:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-25 05:38:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:38:06,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:06,984 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:06,985 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-25 05:38:06,985 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:06,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:06,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:06,986 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:07,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:07,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:07,077 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:38:07,078 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 05:38:07,081 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [15], [21], [98], [101], [102], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-25 05:38:07,131 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:38:07,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:38:07,355 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 05:38:07,357 INFO L268 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 39 variables. [2018-01-25 05:38:07,373 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 05:38:07,503 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 82.63% of their original sizes. [2018-01-25 05:38:07,503 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 05:38:07,547 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 05:38:07,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:38:07,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-25 05:38:07,548 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:07,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:38:07,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:38:07,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:38:07,549 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-01-25 05:38:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:09,938 INFO L93 Difference]: Finished difference Result 1710 states and 2487 transitions. [2018-01-25 05:38:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:38:09,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 05:38:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:09,944 INFO L225 Difference]: With dead ends: 1710 [2018-01-25 05:38:09,944 INFO L226 Difference]: Without dead ends: 887 [2018-01-25 05:38:09,948 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:38:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-01-25 05:38:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 864. [2018-01-25 05:38:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-01-25 05:38:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1256 transitions. [2018-01-25 05:38:10,015 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1256 transitions. Word has length 26 [2018-01-25 05:38:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:10,015 INFO L432 AbstractCegarLoop]: Abstraction has 864 states and 1256 transitions. [2018-01-25 05:38:10,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:38:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1256 transitions. [2018-01-25 05:38:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:38:10,017 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:10,017 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:10,017 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:10,017 INFO L82 PathProgramCache]: Analyzing trace with hash -938176756, now seen corresponding path program 1 times [2018-01-25 05:38:10,017 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:10,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:10,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:10,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:10,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:10,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:10,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:10,172 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:38:10,172 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 05:38:10,172 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [15], [21], [98], [101], [102], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-25 05:38:10,174 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:38:10,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:38:10,347 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:38:10,347 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-25 05:38:10,361 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:38:10,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:10,361 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:38:10,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:10,376 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:38:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:10,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:38:10,586 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-25 05:38:10,586 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:38:10,966 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-25 05:38:10,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:10,988 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:38:11,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:11,000 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:38:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:11,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:38:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:11,225 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:38:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:11,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:38:11,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 6, 6] total 17 [2018-01-25 05:38:11,369 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:38:11,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:38:11,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:38:11,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:38:11,370 INFO L87 Difference]: Start difference. First operand 864 states and 1256 transitions. Second operand 13 states. [2018-01-25 05:38:14,670 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 19 DAG size of output 19 [2018-01-25 05:38:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:16,306 INFO L93 Difference]: Finished difference Result 5030 states and 8073 transitions. [2018-01-25 05:38:16,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-01-25 05:38:16,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-01-25 05:38:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:16,326 INFO L225 Difference]: With dead ends: 5030 [2018-01-25 05:38:16,326 INFO L226 Difference]: Without dead ends: 4207 [2018-01-25 05:38:16,333 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2972 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1434, Invalid=6756, Unknown=0, NotChecked=0, Total=8190 [2018-01-25 05:38:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2018-01-25 05:38:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 3116. [2018-01-25 05:38:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2018-01-25 05:38:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4429 transitions. [2018-01-25 05:38:16,522 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4429 transitions. Word has length 26 [2018-01-25 05:38:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:16,522 INFO L432 AbstractCegarLoop]: Abstraction has 3116 states and 4429 transitions. [2018-01-25 05:38:16,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:38:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4429 transitions. [2018-01-25 05:38:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:38:16,523 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:16,540 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:16,540 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-25 05:38:16,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-01-25 05:38:16,540 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:16,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:16,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:16,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:16,542 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:16,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:16,674 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-25 05:38:16,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:16,674 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:38:16,674 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 05:38:16,674 INFO L201 CegarAbsIntRunner]: [2], [4], [9], [13], [15], [18], [29], [33], [47], [49], [50], [53], [54], [55], [56], [59], [97], [146], [147], [151], [152], [155], [156], [157] [2018-01-25 05:38:16,676 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:38:16,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:38:52,356 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:38:52,356 INFO L268 AbstractInterpreter]: Visited 24 different actions 43 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-01-25 05:38:52,363 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:38:52,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:52,363 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:38:52,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:52,368 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:38:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:52,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:38:52,405 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:38:52,405 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:38:52,408 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:38:52,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:38:52 BoogieIcfgContainer [2018-01-25 05:38:52,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:38:52,409 INFO L168 Benchmark]: Toolchain (without parser) took 48121.60 ms. Allocated memory was 308.3 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 267.3 MB in the beginning and 1.2 GB in the end (delta: -925.4 MB). Peak memory consumption was 870.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:52,410 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:38:52,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.92 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 255.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:52,410 INFO L168 Benchmark]: Boogie Preprocessor took 41.51 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:52,411 INFO L168 Benchmark]: RCFGBuilder took 397.32 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 228.6 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:52,411 INFO L168 Benchmark]: TraceAbstraction took 47449.26 ms. Allocated memory was 308.3 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 228.6 MB in the beginning and 1.2 GB in the end (delta: -964.1 MB). Peak memory consumption was 832.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:38:52,413 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.22 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.92 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 255.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.51 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 397.32 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 228.6 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 47449.26 ms. Allocated memory was 308.3 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 228.6 MB in the beginning and 1.2 GB in the end (delta: -964.1 MB). Peak memory consumption was 832.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 7 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 175 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -14 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 12 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 94 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 15 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.083058 RENAME_VARIABLES(MILLISECONDS) : 0.282758 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.988945 PROJECTAWAY(MILLISECONDS) : 0.089912 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.735105 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.338751 ADD_EQUALITY(MILLISECONDS) : 0.043239 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014683 #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.581582 RENAME_VARIABLES(MILLISECONDS) : 0.133740 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.538687 PROJECTAWAY(MILLISECONDS) : 0.118852 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.258550 DISJOIN(MILLISECONDS) : 0.253368 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.159040 ADD_EQUALITY(MILLISECONDS) : 0.119868 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.025177 #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 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 20 LocStat_MAX_SIZEOF_WEQEDGELABEL : 6 LocStat_NO_SUPPORTING_EQUALITIES : 538 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 14 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 164 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 280.323024 RENAME_VARIABLES(MILLISECONDS) : 0.002999 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 279.634068 PROJECTAWAY(MILLISECONDS) : 2454.473639 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048906 DISJOIN(MILLISECONDS) : 0.175063 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.010469 ADD_EQUALITY(MILLISECONDS) : 0.029081 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020375 #CONJOIN_DISJUNCTIVE : 89 #RENAME_VARIABLES : 181 #UNFREEZE : 0 #CONJOIN : 285 #PROJECTAWAY : 127 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 28 #RENAME_VARIABLES_DISJUNCTIVE : 166 #ADD_EQUALITY : 168 #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, 47.3s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 8.2s 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.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 247 GetRequests, 128 SyntacticMatches, 8 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2974 ImplicationChecksByTransitivity, 3.5s 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, 36.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.2s SatisfiabilityAnalysisTime, 1.4s 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-38-52-423.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-38-52-423.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-38-52-423.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-38-52-423.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-38-52-423.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-38-52-423.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-38-52-423.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-38-52-423.csv Completed graceful shutdown