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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 21:58:27,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 21:58:27,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 21:58:27,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 21:58:27,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 21:58:27,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 21:58:27,073 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 21:58:27,075 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 21:58:27,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 21:58:27,077 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 21:58:27,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 21:58:27,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 21:58:27,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 21:58:27,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 21:58:27,080 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 21:58:27,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 21:58:27,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 21:58:27,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 21:58:27,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 21:58:27,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 21:58:27,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 21:58:27,091 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 21:58:27,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 21:58:27,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 21:58:27,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 21:58:27,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 21:58:27,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 21:58:27,095 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 21:58:27,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 21:58:27,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 21:58:27,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 21:58:27,096 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 21:58:27,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 21:58:27,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 21:58:27,107 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 21:58:27,107 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 21:58:27,107 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 21:58:27,108 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 21:58:27,108 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 21:58:27,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 21:58:27,108 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 21:58:27,109 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 21:58:27,109 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 21:58:27,109 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 21:58:27,109 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 21:58:27,109 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 21:58:27,110 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 21:58:27,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 21:58:27,110 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 21:58:27,110 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 21:58:27,110 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 21:58:27,110 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 21:58:27,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 21:58:27,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 21:58:27,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 21:58:27,111 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 21:58:27,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 21:58:27,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 21:58:27,112 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 21:58:27,112 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 21:58:27,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 21:58:27,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 21:58:27,113 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 21:58:27,113 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 21:58:27,113 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 21:58:27,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 21:58:27,113 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 21:58:27,114 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 21:58:27,114 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 21:58:27,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 21:58:27,161 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 21:58:27,165 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 21:58:27,166 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 21:58:27,167 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 21:58:27,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i [2018-01-20 21:58:27,347 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 21:58:27,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 21:58:27,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 21:58:27,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 21:58:27,358 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 21:58:27,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:58:27" (1/1) ... [2018-01-20 21:58:27,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4454cf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27, skipping insertion in model container [2018-01-20 21:58:27,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:58:27" (1/1) ... [2018-01-20 21:58:27,375 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:58:27,411 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:58:27,526 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:58:27,545 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:58:27,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27 WrapperNode [2018-01-20 21:58:27,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 21:58:27,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 21:58:27,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 21:58:27,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 21:58:27,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27" (1/1) ... [2018-01-20 21:58:27,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27" (1/1) ... [2018-01-20 21:58:27,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27" (1/1) ... [2018-01-20 21:58:27,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27" (1/1) ... [2018-01-20 21:58:27,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27" (1/1) ... [2018-01-20 21:58:27,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27" (1/1) ... [2018-01-20 21:58:27,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27" (1/1) ... [2018-01-20 21:58:27,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 21:58:27,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 21:58:27,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 21:58:27,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 21:58:27,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27" (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-20 21:58:27,636 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 21:58:27,636 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 21:58:27,636 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-20 21:58:27,637 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-20 21:58:27,637 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 21:58:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 21:58:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 21:58:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 21:58:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 21:58:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 21:58:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 21:58:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 21:58:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 21:58:27,638 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 21:58:27,638 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 21:58:27,638 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-20 21:58:27,638 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-20 21:58:27,638 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 21:58:27,638 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 21:58:27,638 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 21:58:27,921 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 21:58:27,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:58:27 BoogieIcfgContainer [2018-01-20 21:58:27,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 21:58:27,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 21:58:27,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 21:58:27,926 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 21:58:27,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 09:58:27" (1/3) ... [2018-01-20 21:58:27,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5385e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:58:27, skipping insertion in model container [2018-01-20 21:58:27,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:58:27" (2/3) ... [2018-01-20 21:58:27,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5385e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:58:27, skipping insertion in model container [2018-01-20 21:58:27,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:58:27" (3/3) ... [2018-01-20 21:58:27,930 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2018-01-20 21:58:27,939 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 21:58:27,946 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-20 21:58:27,986 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:58:27,986 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:58:27,986 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:58:27,986 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:58:27,986 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:58:27,987 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:58:27,987 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:58:27,987 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == popErr0EnsuresViolation======== [2018-01-20 21:58:27,987 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:58:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 21:58:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 21:58:28,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:28,016 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:28,016 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr0EnsuresViolation]=== [2018-01-20 21:58:28,020 INFO L82 PathProgramCache]: Analyzing trace with hash 816843792, now seen corresponding path program 1 times [2018-01-20 21:58:28,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:28,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:28,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:28,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:28,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:28,208 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-20 21:58:28,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:58:28,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-20 21:58:28,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:58:28,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:58:28,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:58:28,225 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-20 21:58:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:28,322 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-01-20 21:58:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:58:28,324 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-20 21:58:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:28,331 INFO L225 Difference]: With dead ends: 75 [2018-01-20 21:58:28,331 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:58:28,335 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-20 21:58:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:58:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:58:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:58:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:58:28,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-20 21:58:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:28,359 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:58:28,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:58:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:58:28,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:58:28,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 21:58:28,397 INFO L401 ceAbstractionStarter]: For program point L681(line 681) no Hoare annotation was computed. [2018-01-20 21:58:28,398 INFO L401 ceAbstractionStarter]: For program point L680(line 680) no Hoare annotation was computed. [2018-01-20 21:58:28,398 INFO L401 ceAbstractionStarter]: For program point popEXIT(lines 660 687) no Hoare annotation was computed. [2018-01-20 21:58:28,398 INFO L401 ceAbstractionStarter]: For program point L663(lines 663 686) no Hoare annotation was computed. [2018-01-20 21:58:28,398 INFO L404 ceAbstractionStarter]: At program point popENTRY(lines 660 687) the Hoare annotation is: true [2018-01-20 21:58:28,398 INFO L401 ceAbstractionStarter]: For program point L682(line 682) no Hoare annotation was computed. [2018-01-20 21:58:28,398 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-20 21:58:28,398 INFO L401 ceAbstractionStarter]: For program point L672'(line 672) no Hoare annotation was computed. [2018-01-20 21:58:28,398 INFO L401 ceAbstractionStarter]: For program point L664(line 664) no Hoare annotation was computed. [2018-01-20 21:58:28,398 INFO L401 ceAbstractionStarter]: For program point L682'(line 682) no Hoare annotation was computed. [2018-01-20 21:58:28,399 INFO L401 ceAbstractionStarter]: For program point L668(lines 668 669) no Hoare annotation was computed. [2018-01-20 21:58:28,399 INFO L401 ceAbstractionStarter]: For program point L674(line 674) no Hoare annotation was computed. [2018-01-20 21:58:28,399 INFO L401 ceAbstractionStarter]: For program point L672(line 672) no Hoare annotation was computed. [2018-01-20 21:58:28,399 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-20 21:58:28,399 INFO L401 ceAbstractionStarter]: For program point L675(lines 675 678) no Hoare annotation was computed. [2018-01-20 21:58:28,399 INFO L401 ceAbstractionStarter]: For program point L675''(lines 675 678) no Hoare annotation was computed. [2018-01-20 21:58:28,399 INFO L401 ceAbstractionStarter]: For program point L681'(line 681) no Hoare annotation was computed. [2018-01-20 21:58:28,400 INFO L401 ceAbstractionStarter]: For program point popErr0EnsuresViolation(lines 660 687) no Hoare annotation was computed. [2018-01-20 21:58:28,400 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 707) no Hoare annotation was computed. [2018-01-20 21:58:28,400 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 707) no Hoare annotation was computed. [2018-01-20 21:58:28,400 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 707) the Hoare annotation is: true [2018-01-20 21:58:28,400 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 707) no Hoare annotation was computed. [2018-01-20 21:58:28,400 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 707) the Hoare annotation is: true [2018-01-20 21:58:28,400 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 707) no Hoare annotation was computed. [2018-01-20 21:58:28,401 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 707) the Hoare annotation is: true [2018-01-20 21:58:28,401 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 707) no Hoare annotation was computed. [2018-01-20 21:58:28,401 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 707) no Hoare annotation was computed. [2018-01-20 21:58:28,401 INFO L404 ceAbstractionStarter]: At program point L694'(line 694) the Hoare annotation is: true [2018-01-20 21:58:28,401 INFO L401 ceAbstractionStarter]: For program point L690'(line 690) no Hoare annotation was computed. [2018-01-20 21:58:28,401 INFO L401 ceAbstractionStarter]: For program point L697'(line 697) no Hoare annotation was computed. [2018-01-20 21:58:28,402 INFO L401 ceAbstractionStarter]: For program point L696'''(lines 696 700) no Hoare annotation was computed. [2018-01-20 21:58:28,402 INFO L401 ceAbstractionStarter]: For program point L690'''(line 690) no Hoare annotation was computed. [2018-01-20 21:58:28,402 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 688 707) no Hoare annotation was computed. [2018-01-20 21:58:28,402 INFO L404 ceAbstractionStarter]: At program point L692(line 692) the Hoare annotation is: true [2018-01-20 21:58:28,402 INFO L401 ceAbstractionStarter]: For program point L691(lines 691 694) no Hoare annotation was computed. [2018-01-20 21:58:28,402 INFO L401 ceAbstractionStarter]: For program point L690(lines 690 695) no Hoare annotation was computed. [2018-01-20 21:58:28,402 INFO L401 ceAbstractionStarter]: For program point L696(lines 696 700) no Hoare annotation was computed. [2018-01-20 21:58:28,403 INFO L401 ceAbstractionStarter]: For program point L696''(lines 696 700) no Hoare annotation was computed. [2018-01-20 21:58:28,403 INFO L404 ceAbstractionStarter]: At program point L694(line 694) the Hoare annotation is: true [2018-01-20 21:58:28,403 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 688 707) no Hoare annotation was computed. [2018-01-20 21:58:28,403 INFO L401 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-01-20 21:58:28,403 INFO L401 ceAbstractionStarter]: For program point L697(line 697) no Hoare annotation was computed. [2018-01-20 21:58:28,403 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 688 707) no Hoare annotation was computed. [2018-01-20 21:58:28,403 INFO L401 ceAbstractionStarter]: For program point L698'(line 698) no Hoare annotation was computed. [2018-01-20 21:58:28,404 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-20 21:58:28,404 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-20 21:58:28,404 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-20 21:58:28,404 INFO L401 ceAbstractionStarter]: For program point L647''(lines 647 650) no Hoare annotation was computed. [2018-01-20 21:58:28,404 INFO L401 ceAbstractionStarter]: For program point L647(lines 647 650) no Hoare annotation was computed. [2018-01-20 21:58:28,404 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-20 21:58:28,404 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-20 21:58:28,405 INFO L404 ceAbstractionStarter]: At program point pushENTRY(lines 629 656) the Hoare annotation is: true [2018-01-20 21:58:28,405 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-20 21:58:28,405 INFO L401 ceAbstractionStarter]: For program point pushErr0EnsuresViolation(lines 629 656) no Hoare annotation was computed. [2018-01-20 21:58:28,405 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-20 21:58:28,405 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-20 21:58:28,405 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-20 21:58:28,405 INFO L401 ceAbstractionStarter]: For program point L631(lines 631 655) no Hoare annotation was computed. [2018-01-20 21:58:28,406 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-20 21:58:28,406 INFO L401 ceAbstractionStarter]: For program point pushEXIT(lines 629 656) no Hoare annotation was computed. [2018-01-20 21:58:28,406 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-20 21:58:28,406 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-20 21:58:28,410 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:58:28,410 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:58:28,410 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:58:28,410 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:58:28,410 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:58:28,411 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:58:28,411 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:58:28,411 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 21:58:28,411 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:58:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 21:58:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 21:58:28,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:28,414 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 21:58:28,414 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 21:58:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash 169454, now seen corresponding path program 1 times [2018-01-20 21:58:28,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:28,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:28,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:28,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:58:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:58:28,461 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:58:28,469 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:58:28,479 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:58:28,479 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:58:28,480 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:58:28,480 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:58:28,480 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:58:28,480 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:58:28,480 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:58:28,480 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 21:58:28,480 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:58:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 21:58:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-20 21:58:28,482 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:28,482 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:28,482 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:58:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1316586551, now seen corresponding path program 1 times [2018-01-20 21:58:28,483 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:28,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:28,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:28,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:28,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:28,515 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-20 21:58:28,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:58:28,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:58:28,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:58:28,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:58:28,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:58:28,517 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-20 21:58:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:28,523 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-01-20 21:58:28,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:58:28,523 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-20 21:58:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:28,529 INFO L225 Difference]: With dead ends: 75 [2018-01-20 21:58:28,530 INFO L226 Difference]: Without dead ends: 57 [2018-01-20 21:58:28,530 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-20 21:58:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-20 21:58:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-20 21:58:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-20 21:58:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2018-01-20 21:58:28,546 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 11 [2018-01-20 21:58:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:28,546 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2018-01-20 21:58:28,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:58:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-01-20 21:58:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 21:58:28,547 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:28,547 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:28,548 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:58:28,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2092868013, now seen corresponding path program 1 times [2018-01-20 21:58:28,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:28,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:28,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:28,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:28,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:28,599 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-20 21:58:28,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:58:28,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:58:28,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 21:58:28,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 21:58:28,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:58:28,602 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 3 states. [2018-01-20 21:58:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:28,628 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2018-01-20 21:58:28,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 21:58:28,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-20 21:58:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:28,630 INFO L225 Difference]: With dead ends: 69 [2018-01-20 21:58:28,630 INFO L226 Difference]: Without dead ends: 58 [2018-01-20 21:58:28,631 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-20 21:58:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-20 21:58:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-20 21:58:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-20 21:58:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2018-01-20 21:58:28,638 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 15 [2018-01-20 21:58:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:28,638 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2018-01-20 21:58:28,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 21:58:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2018-01-20 21:58:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 21:58:28,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:28,639 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:28,639 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:58:28,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1392752657, now seen corresponding path program 1 times [2018-01-20 21:58:28,640 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:28,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:28,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:28,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:58:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:58:28,695 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:58:28,703 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:58:28,709 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:58:28,710 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:58:28,718 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:58:28,718 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:58:28,718 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:58:28,718 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:58:28,718 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:58:28,718 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:58:28,718 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:58:28,719 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 21:58:28,719 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:58:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 21:58:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-20 21:58:28,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:28,720 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:28,720 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:28,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1784608256, now seen corresponding path program 1 times [2018-01-20 21:58:28,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:28,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:28,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:28,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:28,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:28,740 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-20 21:58:28,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:58:28,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:58:28,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:58:28,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:58:28,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:58:28,741 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-20 21:58:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:28,744 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-01-20 21:58:28,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:58:28,744 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-20 21:58:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:28,746 INFO L225 Difference]: With dead ends: 75 [2018-01-20 21:58:28,746 INFO L226 Difference]: Without dead ends: 55 [2018-01-20 21:58:28,746 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-20 21:58:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-20 21:58:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-20 21:58:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-20 21:58:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-01-20 21:58:28,751 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 9 [2018-01-20 21:58:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:28,751 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-01-20 21:58:28,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:58:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-01-20 21:58:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 21:58:28,752 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:28,752 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:28,752 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:28,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1548658460, now seen corresponding path program 1 times [2018-01-20 21:58:28,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:28,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:28,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:28,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:28,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:28,795 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-20 21:58:28,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:58:28,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:58:28,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 21:58:28,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 21:58:28,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:58:28,796 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand 3 states. [2018-01-20 21:58:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:28,814 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2018-01-20 21:58:28,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 21:58:28,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-20 21:58:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:28,816 INFO L225 Difference]: With dead ends: 65 [2018-01-20 21:58:28,816 INFO L226 Difference]: Without dead ends: 56 [2018-01-20 21:58:28,816 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-20 21:58:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-20 21:58:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-20 21:58:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-20 21:58:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2018-01-20 21:58:28,823 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 13 [2018-01-20 21:58:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:28,824 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2018-01-20 21:58:28,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 21:58:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2018-01-20 21:58:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 21:58:28,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:28,825 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:28,825 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:28,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1605916762, now seen corresponding path program 1 times [2018-01-20 21:58:28,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:28,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:28,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:28,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:28,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:28,861 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-20 21:58:28,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:58:28,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:58:28,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 21:58:28,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 21:58:28,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:58:28,862 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 3 states. [2018-01-20 21:58:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:28,965 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-01-20 21:58:29,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 21:58:29,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-20 21:58:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:29,002 INFO L225 Difference]: With dead ends: 65 [2018-01-20 21:58:29,002 INFO L226 Difference]: Without dead ends: 62 [2018-01-20 21:58:29,003 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-20 21:58:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-20 21:58:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-01-20 21:58:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-20 21:58:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2018-01-20 21:58:29,010 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 13 [2018-01-20 21:58:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:29,010 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2018-01-20 21:58:29,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 21:58:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2018-01-20 21:58:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 21:58:29,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:29,012 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:29,012 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1614897922, now seen corresponding path program 1 times [2018-01-20 21:58:29,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:29,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:29,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:29,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:29,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:29,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:58:29,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:58:29,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 21:58:29,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 21:58:29,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 21:58:29,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 21:58:29,065 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand 4 states. [2018-01-20 21:58:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:29,135 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2018-01-20 21:58:29,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 21:58:29,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-20 21:58:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:29,138 INFO L225 Difference]: With dead ends: 114 [2018-01-20 21:58:29,138 INFO L226 Difference]: Without dead ends: 100 [2018-01-20 21:58:29,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-20 21:58:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-20 21:58:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2018-01-20 21:58:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-20 21:58:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2018-01-20 21:58:29,154 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 19 [2018-01-20 21:58:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:29,155 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2018-01-20 21:58:29,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 21:58:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2018-01-20 21:58:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 21:58:29,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:29,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:29,158 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash -302614467, now seen corresponding path program 1 times [2018-01-20 21:58:29,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:29,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:29,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:29,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:29,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:29,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 21:58:29,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:58:29,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 21:58:29,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 21:58:29,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 21:58:29,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 21:58:29,307 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand 7 states. [2018-01-20 21:58:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:29,700 INFO L93 Difference]: Finished difference Result 227 states and 312 transitions. [2018-01-20 21:58:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 21:58:29,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-20 21:58:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:29,705 INFO L225 Difference]: With dead ends: 227 [2018-01-20 21:58:29,705 INFO L226 Difference]: Without dead ends: 174 [2018-01-20 21:58:29,705 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-20 21:58:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-20 21:58:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2018-01-20 21:58:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-20 21:58:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 207 transitions. [2018-01-20 21:58:29,730 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 207 transitions. Word has length 37 [2018-01-20 21:58:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:29,730 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 207 transitions. [2018-01-20 21:58:29,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 21:58:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 207 transitions. [2018-01-20 21:58:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-20 21:58:29,733 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:29,733 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:29,733 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1718063660, now seen corresponding path program 1 times [2018-01-20 21:58:29,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:29,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:29,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:29,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:29,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:29,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 21:58:29,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:29,995 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 21:58:30,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:30,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 21:58:30,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:30,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-01-20 21:58:30,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-20 21:58:30,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-20 21:58:30,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-01-20 21:58:30,532 INFO L87 Difference]: Start difference. First operand 150 states and 207 transitions. Second operand 18 states. [2018-01-20 21:58:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:37,908 INFO L93 Difference]: Finished difference Result 2593 states and 4061 transitions. [2018-01-20 21:58:37,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-01-20 21:58:37,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-01-20 21:58:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:37,927 INFO L225 Difference]: With dead ends: 2593 [2018-01-20 21:58:37,928 INFO L226 Difference]: Without dead ends: 2358 [2018-01-20 21:58:37,946 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18392 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3413, Invalid=40477, Unknown=0, NotChecked=0, Total=43890 [2018-01-20 21:58:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2018-01-20 21:58:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 1587. [2018-01-20 21:58:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2018-01-20 21:58:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2384 transitions. [2018-01-20 21:58:38,109 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2384 transitions. Word has length 47 [2018-01-20 21:58:38,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:38,109 INFO L432 AbstractCegarLoop]: Abstraction has 1587 states and 2384 transitions. [2018-01-20 21:58:38,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-20 21:58:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2384 transitions. [2018-01-20 21:58:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-20 21:58:38,115 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:38,115 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:38,115 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash -5705742, now seen corresponding path program 1 times [2018-01-20 21:58:38,116 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:38,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:38,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:38,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:38,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:38,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 21:58:38,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:38,217 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:38,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:38,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 21:58:38,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 21:58:38,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-20 21:58:38,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 21:58:38,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 21:58:38,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-20 21:58:38,394 INFO L87 Difference]: Start difference. First operand 1587 states and 2384 transitions. Second operand 9 states. [2018-01-20 21:58:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:38,818 INFO L93 Difference]: Finished difference Result 3388 states and 5163 transitions. [2018-01-20 21:58:38,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 21:58:38,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-20 21:58:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:38,825 INFO L225 Difference]: With dead ends: 3388 [2018-01-20 21:58:38,825 INFO L226 Difference]: Without dead ends: 1806 [2018-01-20 21:58:38,829 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-01-20 21:58:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2018-01-20 21:58:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1760. [2018-01-20 21:58:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1760 states. [2018-01-20 21:58:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2648 transitions. [2018-01-20 21:58:38,937 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2648 transitions. Word has length 49 [2018-01-20 21:58:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:38,937 INFO L432 AbstractCegarLoop]: Abstraction has 1760 states and 2648 transitions. [2018-01-20 21:58:38,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 21:58:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2648 transitions. [2018-01-20 21:58:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-20 21:58:38,942 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:38,943 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:38,943 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash -739910342, now seen corresponding path program 1 times [2018-01-20 21:58:38,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:38,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:38,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:38,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:38,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:38,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:39,244 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-01-20 21:58:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 21:58:39,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:39,489 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 21:58:39,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:39,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 21:58:40,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:40,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-20 21:58:40,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-20 21:58:40,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-20 21:58:40,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-01-20 21:58:40,055 INFO L87 Difference]: Start difference. First operand 1760 states and 2648 transitions. Second operand 16 states. [2018-01-20 21:58:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:41,583 INFO L93 Difference]: Finished difference Result 5905 states and 9051 transitions. [2018-01-20 21:58:41,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-20 21:58:41,584 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-01-20 21:58:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:41,609 INFO L225 Difference]: With dead ends: 5905 [2018-01-20 21:58:41,609 INFO L226 Difference]: Without dead ends: 4024 [2018-01-20 21:58:41,617 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-01-20 21:58:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2018-01-20 21:58:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3206. [2018-01-20 21:58:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2018-01-20 21:58:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 4719 transitions. [2018-01-20 21:58:41,868 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 4719 transitions. Word has length 52 [2018-01-20 21:58:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:41,868 INFO L432 AbstractCegarLoop]: Abstraction has 3206 states and 4719 transitions. [2018-01-20 21:58:41,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-20 21:58:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 4719 transitions. [2018-01-20 21:58:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-20 21:58:41,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:41,877 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:41,877 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1934353396, now seen corresponding path program 1 times [2018-01-20 21:58:41,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:41,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:41,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:41,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:41,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:41,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 33 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-20 21:58:42,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:42,123 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:42,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:42,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-20 21:58:42,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 21:58:42,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2018-01-20 21:58:42,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-20 21:58:42,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-20 21:58:42,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-20 21:58:42,373 INFO L87 Difference]: Start difference. First operand 3206 states and 4719 transitions. Second operand 13 states. [2018-01-20 21:58:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:43,982 INFO L93 Difference]: Finished difference Result 8050 states and 11902 transitions. [2018-01-20 21:58:43,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-20 21:58:43,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-01-20 21:58:43,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:44,012 INFO L225 Difference]: With dead ends: 8050 [2018-01-20 21:58:44,013 INFO L226 Difference]: Without dead ends: 4829 [2018-01-20 21:58:44,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=310, Invalid=1172, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 21:58:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4829 states. [2018-01-20 21:58:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4829 to 4173. [2018-01-20 21:58:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4173 states. [2018-01-20 21:58:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 6047 transitions. [2018-01-20 21:58:44,325 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 6047 transitions. Word has length 69 [2018-01-20 21:58:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:44,326 INFO L432 AbstractCegarLoop]: Abstraction has 4173 states and 6047 transitions. [2018-01-20 21:58:44,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-20 21:58:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 6047 transitions. [2018-01-20 21:58:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-20 21:58:44,333 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:44,334 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:44,334 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:44,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2020314322, now seen corresponding path program 1 times [2018-01-20 21:58:44,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:44,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:44,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:44,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:44,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:44,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-20 21:58:44,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:44,607 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:44,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:44,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-20 21:58:44,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:44,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-01-20 21:58:44,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-20 21:58:44,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-20 21:58:44,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-01-20 21:58:44,787 INFO L87 Difference]: Start difference. First operand 4173 states and 6047 transitions. Second operand 17 states. [2018-01-20 21:58:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:47,454 INFO L93 Difference]: Finished difference Result 9175 states and 13311 transitions. [2018-01-20 21:58:47,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-01-20 21:58:47,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-01-20 21:58:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:47,484 INFO L225 Difference]: With dead ends: 9175 [2018-01-20 21:58:47,484 INFO L226 Difference]: Without dead ends: 5391 [2018-01-20 21:58:47,499 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3502 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1476, Invalid=7644, Unknown=0, NotChecked=0, Total=9120 [2018-01-20 21:58:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5391 states. [2018-01-20 21:58:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5391 to 4899. [2018-01-20 21:58:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4899 states. [2018-01-20 21:58:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 7075 transitions. [2018-01-20 21:58:47,880 INFO L78 Accepts]: Start accepts. Automaton has 4899 states and 7075 transitions. Word has length 75 [2018-01-20 21:58:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:47,880 INFO L432 AbstractCegarLoop]: Abstraction has 4899 states and 7075 transitions. [2018-01-20 21:58:47,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-20 21:58:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4899 states and 7075 transitions. [2018-01-20 21:58:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-20 21:58:47,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:47,891 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:47,891 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:47,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1684307779, now seen corresponding path program 1 times [2018-01-20 21:58:47,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:47,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:47,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:47,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:47,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:47,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-20 21:58:47,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:58:47,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 21:58:47,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 21:58:47,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 21:58:47,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 21:58:47,995 INFO L87 Difference]: Start difference. First operand 4899 states and 7075 transitions. Second operand 7 states. [2018-01-20 21:58:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:48,674 INFO L93 Difference]: Finished difference Result 14090 states and 21862 transitions. [2018-01-20 21:58:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 21:58:48,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-01-20 21:58:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:48,719 INFO L225 Difference]: With dead ends: 14090 [2018-01-20 21:58:48,719 INFO L226 Difference]: Without dead ends: 9196 [2018-01-20 21:58:48,737 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-20 21:58:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9196 states. [2018-01-20 21:58:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9196 to 7718. [2018-01-20 21:58:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7718 states. [2018-01-20 21:58:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 11154 transitions. [2018-01-20 21:58:49,298 INFO L78 Accepts]: Start accepts. Automaton has 7718 states and 11154 transitions. Word has length 84 [2018-01-20 21:58:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:49,299 INFO L432 AbstractCegarLoop]: Abstraction has 7718 states and 11154 transitions. [2018-01-20 21:58:49,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 21:58:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 7718 states and 11154 transitions. [2018-01-20 21:58:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-20 21:58:49,324 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:49,324 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:49,325 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash -88146236, now seen corresponding path program 1 times [2018-01-20 21:58:49,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:49,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:49,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:49,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:49,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:49,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-20 21:58:49,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:49,459 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:49,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:49,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-20 21:58:49,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 21:58:49,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-20 21:58:49,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 21:58:49,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 21:58:49,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-20 21:58:49,703 INFO L87 Difference]: Start difference. First operand 7718 states and 11154 transitions. Second operand 9 states. [2018-01-20 21:58:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:50,399 INFO L93 Difference]: Finished difference Result 17213 states and 25797 transitions. [2018-01-20 21:58:50,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 21:58:50,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-01-20 21:58:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:50,434 INFO L225 Difference]: With dead ends: 17213 [2018-01-20 21:58:50,434 INFO L226 Difference]: Without dead ends: 9500 [2018-01-20 21:58:50,455 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-01-20 21:58:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9500 states. [2018-01-20 21:58:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9500 to 7718. [2018-01-20 21:58:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7718 states. [2018-01-20 21:58:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 11154 transitions. [2018-01-20 21:58:50,964 INFO L78 Accepts]: Start accepts. Automaton has 7718 states and 11154 transitions. Word has length 96 [2018-01-20 21:58:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:50,965 INFO L432 AbstractCegarLoop]: Abstraction has 7718 states and 11154 transitions. [2018-01-20 21:58:50,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 21:58:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7718 states and 11154 transitions. [2018-01-20 21:58:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-20 21:58:50,975 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:50,975 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:50,975 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1165934552, now seen corresponding path program 1 times [2018-01-20 21:58:50,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:50,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:50,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:50,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:50,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:50,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-20 21:58:51,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:51,051 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:51,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:51,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:51,139 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|push_#t~malloc2.base| Int)) (and (<= (select |c_old(#valid)| |push_#t~malloc2.base|) 0) (= |c_#valid| (store |c_old(#valid)| |push_#t~malloc2.base| 1)))) is different from true [2018-01-20 21:58:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-01-20 21:58:51,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 21:58:51,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 21:58:51,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 21:58:51,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 21:58:51,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-20 21:58:51,184 INFO L87 Difference]: Start difference. First operand 7718 states and 11154 transitions. Second operand 5 states. [2018-01-20 21:58:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:58:51,839 INFO L93 Difference]: Finished difference Result 15586 states and 22786 transitions. [2018-01-20 21:58:51,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:58:51,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-01-20 21:58:51,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:58:51,863 INFO L225 Difference]: With dead ends: 15586 [2018-01-20 21:58:51,864 INFO L226 Difference]: Without dead ends: 7113 [2018-01-20 21:58:51,879 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-20 21:58:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7113 states. [2018-01-20 21:58:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7113 to 7110. [2018-01-20 21:58:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7110 states. [2018-01-20 21:58:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10394 transitions. [2018-01-20 21:58:52,362 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10394 transitions. Word has length 98 [2018-01-20 21:58:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:58:52,362 INFO L432 AbstractCegarLoop]: Abstraction has 7110 states and 10394 transitions. [2018-01-20 21:58:52,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 21:58:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10394 transitions. [2018-01-20 21:58:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-20 21:58:52,373 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:58:52,374 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:58:52,374 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-20 21:58:52,374 INFO L82 PathProgramCache]: Analyzing trace with hash 331809320, now seen corresponding path program 1 times [2018-01-20 21:58:52,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:58:52,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:58:52,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:52,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:52,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:58:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:52,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:58:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 50 proven. 104 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-20 21:58:52,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:58:52,650 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:58:52,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:58:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:58:52,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:58:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 125 proven. 18 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-20 21:58:52,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:58:52,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-20 21:58:52,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-20 21:58:52,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-20 21:58:52,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-01-20 21:58:52,931 INFO L87 Difference]: Start difference. First operand 7110 states and 10394 transitions. Second operand 19 states. [2018-01-20 21:59:01,224 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 40 DAG size of output 38 [2018-01-20 21:59:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:59:02,999 INFO L93 Difference]: Finished difference Result 33060 states and 51072 transitions. [2018-01-20 21:59:03,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-01-20 21:59:03,000 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2018-01-20 21:59:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:59:03,085 INFO L225 Difference]: With dead ends: 33060 [2018-01-20 21:59:03,085 INFO L226 Difference]: Without dead ends: 28623 [2018-01-20 21:59:03,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25193 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=6407, Invalid=50475, Unknown=0, NotChecked=0, Total=56882 [2018-01-20 21:59:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28623 states. [2018-01-20 21:59:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28623 to 23952. [2018-01-20 21:59:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23952 states. [2018-01-20 21:59:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23952 states to 23952 states and 34987 transitions. [2018-01-20 21:59:04,738 INFO L78 Accepts]: Start accepts. Automaton has 23952 states and 34987 transitions. Word has length 98 [2018-01-20 21:59:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:59:04,738 INFO L432 AbstractCegarLoop]: Abstraction has 23952 states and 34987 transitions. [2018-01-20 21:59:04,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-20 21:59:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 23952 states and 34987 transitions. [2018-01-20 21:59:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-20 21:59:04,754 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:59:04,754 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:59:04,754 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-20 21:59:04,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1202857125, now seen corresponding path program 1 times [2018-01-20 21:59:04,754 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:59:04,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:59:04,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:59:04,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:59:04,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:59:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:59:04,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:59:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 69 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-01-20 21:59:04,942 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:59:04,942 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:59:04,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:59:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:59:05,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:59:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-01-20 21:59:05,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:59:05,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-01-20 21:59:05,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-20 21:59:05,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-20 21:59:05,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-20 21:59:05,134 INFO L87 Difference]: Start difference. First operand 23952 states and 34987 transitions. Second operand 18 states. Received shutdown request... [2018-01-20 21:59:11,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-01-20 21:59:11,647 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 21:59:11,650 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:59:11,650 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:59:11,650 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:59:11,650 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:59:11,651 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:59:11,651 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:59:11,651 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:59:11,651 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == pushErr0EnsuresViolation======== [2018-01-20 21:59:11,651 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:59:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 21:59:11,652 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 21:59:11,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 09:59:11 BoogieIcfgContainer [2018-01-20 21:59:11,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 21:59:11,654 INFO L168 Benchmark]: Toolchain (without parser) took 44306.06 ms. Allocated memory was 304.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 261.0 MB in the beginning and 837.4 MB in the end (delta: -576.4 MB). Peak memory consumption was 582.8 MB. Max. memory is 5.3 GB. [2018-01-20 21:59:11,656 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 21:59:11,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.24 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 249.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:59:11,656 INFO L168 Benchmark]: Boogie Preprocessor took 33.91 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:59:11,656 INFO L168 Benchmark]: RCFGBuilder took 335.75 ms. Allocated memory is still 304.1 MB. Free memory was 247.0 MB in the beginning and 224.0 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:59:11,656 INFO L168 Benchmark]: TraceAbstraction took 43729.68 ms. Allocated memory was 304.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 224.0 MB in the beginning and 837.4 MB in the end (delta: -613.4 MB). Peak memory consumption was 545.8 MB. Max. memory is 5.3 GB. [2018-01-20 21:59:11,658 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.24 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 249.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.91 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 335.75 ms. Allocated memory is still 304.1 MB. Free memory was 247.0 MB in the beginning and 224.0 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43729.68 ms. Allocated memory was 304.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 224.0 MB in the beginning and 837.4 MB in the end (delta: -613.4 MB). Peak memory consumption was 545.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 660]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: popErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 8 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=17, \old(garbage)=15, \old(pc1)=7, \old(pc4)=11, \old(res4)=5, \old(S)=3, \old(S)=9, \old(t1)=12, \old(t1)=8, \old(t4)=4, \old(t4)=16, \old(x1)=1, \old(x1)=14, \old(x4)=6, \old(x4)=13, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. UNSAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 0 SDslu, 69 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was constructing difference of abstraction (23952states) and interpolant automaton (currently 150 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (75263 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. TIMEOUT Result, 42.9s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 33.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1421 SDtfs, 10258 SDslu, 5736 SDs, 0 SdLazy, 14458 SolverSat, 5263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1804 GetRequests, 991 SyntacticMatches, 2 SemanticMatches, 811 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58221 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23952occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 10750 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1547 NumberOfCodeBlocks, 1547 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1523 ConstructedInterpolants, 4 QuantifiedInterpolants, 288945 SizeOfPredicates, 35 NumberOfNonLiveVariables, 4855 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 1491/1787 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while IsEmpty was searching accepting run (input had 62 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: pushErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_21-59-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_21-59-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_21-59-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_21-59-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_21-59-11-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_21-59-11-666.csv Completed graceful shutdown