java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:21:19,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:21:19,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:21:19,254 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:21:19,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:21:19,256 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:21:19,257 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:21:19,259 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:21:19,261 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:21:19,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:21:19,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:21:19,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:21:19,264 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:21:19,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:21:19,268 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:21:19,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:21:19,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:21:19,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:21:19,280 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:21:19,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:21:19,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:21:19,290 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:21:19,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:21:19,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:21:19,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:21:19,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:21:19,300 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:21:19,301 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:21:19,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:21:19,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:21:19,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:21:19,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:21:19,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:21:19,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:21:19,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:21:19,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:21:19,311 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 01:21:19,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:21:19,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:21:19,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:21:19,340 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:21:19,340 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:21:19,340 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:21:19,341 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:21:19,341 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:21:19,341 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:21:19,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:21:19,343 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:21:19,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:21:19,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:21:19,343 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:21:19,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:21:19,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:21:19,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:21:19,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:21:19,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:21:19,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:21:19,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:21:19,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:21:19,346 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:21:19,347 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:21:19,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:21:19,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:21:19,347 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:21:19,348 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:21:19,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:21:19,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:21:19,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:21:19,440 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:21:19,440 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:21:19,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-07-24 01:21:19,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8c7968c/4705cd8f48ff4b8682c1acb83f8782d0/FLAGb3c93b6d9 [2018-07-24 01:21:20,076 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:21:20,078 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-07-24 01:21:20,104 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8c7968c/4705cd8f48ff4b8682c1acb83f8782d0/FLAGb3c93b6d9 [2018-07-24 01:21:20,128 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8c7968c/4705cd8f48ff4b8682c1acb83f8782d0 [2018-07-24 01:21:20,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:21:20,144 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:21:20,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:21:20,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:21:20,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:21:20,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77928ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20, skipping insertion in model container [2018-07-24 01:21:20,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,367 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:21:20,617 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:21:20,633 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:21:20,799 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:21:20,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20 WrapperNode [2018-07-24 01:21:20,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:21:20,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:21:20,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:21:20,854 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:21:20,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:21:20,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:21:20,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:21:20,967 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:21:20,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:21,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:21,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:21,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:21,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:21:21,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:21:21,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:21:21,206 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:21:21,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... No working directory specified, using /storage/repos/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-07-24 01:21:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:21:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:21:21,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:21:24,555 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:21:24,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:21:24 BoogieIcfgContainer [2018-07-24 01:21:24,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:21:24,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:21:24,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:21:24,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:21:24,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:21:20" (1/3) ... [2018-07-24 01:21:24,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b090223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:21:24, skipping insertion in model container [2018-07-24 01:21:24,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (2/3) ... [2018-07-24 01:21:24,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b090223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:21:24, skipping insertion in model container [2018-07-24 01:21:24,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:21:24" (3/3) ... [2018-07-24 01:21:24,566 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label00_true-unreach-call_false-termination.c [2018-07-24 01:21:24,576 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:21:24,587 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:21:24,653 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:21:24,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:21:24,654 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:21:24,655 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:21:24,655 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:21:24,655 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:21:24,657 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:21:24,657 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:21:24,658 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:21:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2018-07-24 01:21:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-24 01:21:24,702 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:24,704 INFO L353 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:24,704 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:24,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1654512108, now seen corresponding path program 1 times [2018-07-24 01:21:24,710 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:24,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:24,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:25,355 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:25,355 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:25,361 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:25,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:25,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:25,382 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 4 states. [2018-07-24 01:21:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:28,049 INFO L93 Difference]: Finished difference Result 779 states and 1357 transitions. [2018-07-24 01:21:28,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:28,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-07-24 01:21:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:28,076 INFO L225 Difference]: With dead ends: 779 [2018-07-24 01:21:28,076 INFO L226 Difference]: Without dead ends: 544 [2018-07-24 01:21:28,081 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-07-24 01:21:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 370. [2018-07-24 01:21:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-07-24 01:21:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 594 transitions. [2018-07-24 01:21:28,158 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 594 transitions. Word has length 116 [2018-07-24 01:21:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:28,161 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 594 transitions. [2018-07-24 01:21:28,162 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 594 transitions. [2018-07-24 01:21:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-24 01:21:28,171 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:28,172 INFO L353 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:28,172 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:28,172 INFO L82 PathProgramCache]: Analyzing trace with hash -220215521, now seen corresponding path program 1 times [2018-07-24 01:21:28,173 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:28,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:28,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:28,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 01:21:28,486 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:28,486 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:28,489 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:28,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:28,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:28,490 INFO L87 Difference]: Start difference. First operand 370 states and 594 transitions. Second operand 4 states. [2018-07-24 01:21:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:30,094 INFO L93 Difference]: Finished difference Result 1160 states and 1961 transitions. [2018-07-24 01:21:30,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:30,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-07-24 01:21:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:30,104 INFO L225 Difference]: With dead ends: 1160 [2018-07-24 01:21:30,104 INFO L226 Difference]: Without dead ends: 792 [2018-07-24 01:21:30,112 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-07-24 01:21:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2018-07-24 01:21:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-07-24 01:21:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1253 transitions. [2018-07-24 01:21:30,186 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1253 transitions. Word has length 121 [2018-07-24 01:21:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:30,187 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1253 transitions. [2018-07-24 01:21:30,187 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1253 transitions. [2018-07-24 01:21:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-24 01:21:30,202 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:30,202 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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, 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-07-24 01:21:30,203 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash 165815189, now seen corresponding path program 1 times [2018-07-24 01:21:30,203 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:30,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:30,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:30,395 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:30,395 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:30,396 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:30,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:30,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:30,399 INFO L87 Difference]: Start difference. First operand 792 states and 1253 transitions. Second operand 4 states. [2018-07-24 01:21:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:33,826 INFO L93 Difference]: Finished difference Result 2760 states and 4410 transitions. [2018-07-24 01:21:33,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:33,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2018-07-24 01:21:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:33,838 INFO L225 Difference]: With dead ends: 2760 [2018-07-24 01:21:33,838 INFO L226 Difference]: Without dead ends: 1970 [2018-07-24 01:21:33,841 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-07-24 01:21:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1359. [2018-07-24 01:21:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2018-07-24 01:21:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2064 transitions. [2018-07-24 01:21:33,875 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2064 transitions. Word has length 135 [2018-07-24 01:21:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:33,875 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2064 transitions. [2018-07-24 01:21:33,876 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2064 transitions. [2018-07-24 01:21:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-24 01:21:33,879 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:33,879 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-07-24 01:21:33,879 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:33,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2042271861, now seen corresponding path program 1 times [2018-07-24 01:21:33,880 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:33,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:33,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:33,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:33,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:33,970 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:33,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:21:33,971 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:21:33,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:21:33,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:33,974 INFO L87 Difference]: Start difference. First operand 1359 states and 2064 transitions. Second operand 3 states. [2018-07-24 01:21:34,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:34,876 INFO L93 Difference]: Finished difference Result 3844 states and 5858 transitions. [2018-07-24 01:21:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:34,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-07-24 01:21:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:34,889 INFO L225 Difference]: With dead ends: 3844 [2018-07-24 01:21:34,890 INFO L226 Difference]: Without dead ends: 2487 [2018-07-24 01:21:34,892 INFO L573 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-07-24 01:21:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2018-07-24 01:21:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2487. [2018-07-24 01:21:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2018-07-24 01:21:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3505 transitions. [2018-07-24 01:21:34,941 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3505 transitions. Word has length 139 [2018-07-24 01:21:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:34,941 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3505 transitions. [2018-07-24 01:21:34,941 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:21:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3505 transitions. [2018-07-24 01:21:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-24 01:21:34,946 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:34,946 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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, 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, 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-07-24 01:21:34,947 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash -49604438, now seen corresponding path program 1 times [2018-07-24 01:21:34,947 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:34,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:34,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:35,259 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:35,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:35,260 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:35,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:35,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:35,260 INFO L87 Difference]: Start difference. First operand 2487 states and 3505 transitions. Second operand 4 states. [2018-07-24 01:21:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:36,578 INFO L93 Difference]: Finished difference Result 7637 states and 10534 transitions. [2018-07-24 01:21:36,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:36,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-07-24 01:21:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:36,604 INFO L225 Difference]: With dead ends: 7637 [2018-07-24 01:21:36,605 INFO L226 Difference]: Without dead ends: 5152 [2018-07-24 01:21:36,610 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5152 states. [2018-07-24 01:21:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5152 to 5008. [2018-07-24 01:21:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5008 states. [2018-07-24 01:21:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5008 states to 5008 states and 6143 transitions. [2018-07-24 01:21:36,703 INFO L78 Accepts]: Start accepts. Automaton has 5008 states and 6143 transitions. Word has length 140 [2018-07-24 01:21:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:36,703 INFO L471 AbstractCegarLoop]: Abstraction has 5008 states and 6143 transitions. [2018-07-24 01:21:36,703 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5008 states and 6143 transitions. [2018-07-24 01:21:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-24 01:21:36,710 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:36,710 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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-07-24 01:21:36,710 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:36,711 INFO L82 PathProgramCache]: Analyzing trace with hash 169126387, now seen corresponding path program 1 times [2018-07-24 01:21:36,711 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:36,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:36,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:36,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:36,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-07-24 01:21:37,034 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:37,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:37,035 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:37,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:37,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:37,036 INFO L87 Difference]: Start difference. First operand 5008 states and 6143 transitions. Second operand 4 states. [2018-07-24 01:21:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:38,158 INFO L93 Difference]: Finished difference Result 10014 states and 12284 transitions. [2018-07-24 01:21:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:38,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-07-24 01:21:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:38,181 INFO L225 Difference]: With dead ends: 10014 [2018-07-24 01:21:38,182 INFO L226 Difference]: Without dead ends: 5008 [2018-07-24 01:21:38,189 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5008 states. [2018-07-24 01:21:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5008 to 4867. [2018-07-24 01:21:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4867 states. [2018-07-24 01:21:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 5720 transitions. [2018-07-24 01:21:38,289 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 5720 transitions. Word has length 145 [2018-07-24 01:21:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:38,290 INFO L471 AbstractCegarLoop]: Abstraction has 4867 states and 5720 transitions. [2018-07-24 01:21:38,290 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 5720 transitions. [2018-07-24 01:21:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-24 01:21:38,298 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:38,298 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:38,299 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -818999110, now seen corresponding path program 1 times [2018-07-24 01:21:38,299 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:38,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:38,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:38,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:38,486 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:38,486 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:38,487 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:21:38,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:21:38,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:38,487 INFO L87 Difference]: Start difference. First operand 4867 states and 5720 transitions. Second operand 3 states. [2018-07-24 01:21:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:40,572 INFO L93 Difference]: Finished difference Result 9878 states and 11596 transitions. [2018-07-24 01:21:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:40,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2018-07-24 01:21:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:40,591 INFO L225 Difference]: With dead ends: 9878 [2018-07-24 01:21:40,591 INFO L226 Difference]: Without dead ends: 5013 [2018-07-24 01:21:40,597 INFO L573 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-07-24 01:21:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5013 states. [2018-07-24 01:21:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5013 to 5008. [2018-07-24 01:21:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5008 states. [2018-07-24 01:21:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5008 states to 5008 states and 5700 transitions. [2018-07-24 01:21:40,677 INFO L78 Accepts]: Start accepts. Automaton has 5008 states and 5700 transitions. Word has length 158 [2018-07-24 01:21:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:40,678 INFO L471 AbstractCegarLoop]: Abstraction has 5008 states and 5700 transitions. [2018-07-24 01:21:40,678 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:21:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 5008 states and 5700 transitions. [2018-07-24 01:21:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-24 01:21:40,687 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:40,687 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-07-24 01:21:40,688 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1305079500, now seen corresponding path program 1 times [2018-07-24 01:21:40,688 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:40,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:40,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:40,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-07-24 01:21:40,825 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:40,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:40,826 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:21:40,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:21:40,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:40,827 INFO L87 Difference]: Start difference. First operand 5008 states and 5700 transitions. Second operand 3 states. [2018-07-24 01:21:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:41,881 INFO L93 Difference]: Finished difference Result 9442 states and 10741 transitions. [2018-07-24 01:21:41,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:41,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-07-24 01:21:41,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:41,890 INFO L225 Difference]: With dead ends: 9442 [2018-07-24 01:21:41,890 INFO L226 Difference]: Without dead ends: 2862 [2018-07-24 01:21:41,896 INFO L573 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-07-24 01:21:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2018-07-24 01:21:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2862. [2018-07-24 01:21:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2862 states. [2018-07-24 01:21:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 3094 transitions. [2018-07-24 01:21:41,937 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 3094 transitions. Word has length 212 [2018-07-24 01:21:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:41,938 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 3094 transitions. [2018-07-24 01:21:41,938 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:21:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 3094 transitions. [2018-07-24 01:21:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-24 01:21:41,944 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:41,945 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-07-24 01:21:41,945 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:41,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1257654705, now seen corresponding path program 1 times [2018-07-24 01:21:41,945 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:41,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:41,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:41,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:41,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-24 01:21:42,212 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:21:42,212 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-07-24 01:21:42,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:42,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:21:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-24 01:21:42,632 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:21:42,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2018-07-24 01:21:42,633 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 01:21:42,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 01:21:42,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:21:42,633 INFO L87 Difference]: Start difference. First operand 2862 states and 3094 transitions. Second operand 7 states. [2018-07-24 01:21:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:47,928 INFO L93 Difference]: Finished difference Result 5915 states and 6393 transitions. [2018-07-24 01:21:47,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 01:21:47,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2018-07-24 01:21:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:47,952 INFO L225 Difference]: With dead ends: 5915 [2018-07-24 01:21:47,952 INFO L226 Difference]: Without dead ends: 3055 [2018-07-24 01:21:47,956 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-07-24 01:21:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2018-07-24 01:21:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2862. [2018-07-24 01:21:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2862 states. [2018-07-24 01:21:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 3080 transitions. [2018-07-24 01:21:48,017 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 3080 transitions. Word has length 226 [2018-07-24 01:21:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:48,018 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 3080 transitions. [2018-07-24 01:21:48,018 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 01:21:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 3080 transitions. [2018-07-24 01:21:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-24 01:21:48,026 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:48,026 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-07-24 01:21:48,026 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:48,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1229709314, now seen corresponding path program 1 times [2018-07-24 01:21:48,027 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:48,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:48,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-07-24 01:21:48,420 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:48,420 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:48,421 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:48,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:48,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:48,421 INFO L87 Difference]: Start difference. First operand 2862 states and 3080 transitions. Second operand 4 states. [2018-07-24 01:21:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:49,460 INFO L93 Difference]: Finished difference Result 6706 states and 7270 transitions. [2018-07-24 01:21:49,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:49,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2018-07-24 01:21:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:49,473 INFO L225 Difference]: With dead ends: 6706 [2018-07-24 01:21:49,473 INFO L226 Difference]: Without dead ends: 3562 [2018-07-24 01:21:49,476 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2018-07-24 01:21:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3418. [2018-07-24 01:21:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2018-07-24 01:21:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 3630 transitions. [2018-07-24 01:21:49,542 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 3630 transitions. Word has length 254 [2018-07-24 01:21:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 3418 states and 3630 transitions. [2018-07-24 01:21:49,542 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 3630 transitions. [2018-07-24 01:21:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-24 01:21:49,550 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:49,550 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-07-24 01:21:49,550 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:49,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1881802450, now seen corresponding path program 1 times [2018-07-24 01:21:49,551 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:49,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:49,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:49,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:49,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 162 proven. 5 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-07-24 01:21:49,892 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:21:49,892 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-07-24 01:21:49,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:50,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:21:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-07-24 01:21:50,090 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:21:50,090 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-07-24 01:21:50,091 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:21:50,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:21:50,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:21:50,092 INFO L87 Difference]: Start difference. First operand 3418 states and 3630 transitions. Second operand 5 states. [2018-07-24 01:21:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:51,537 INFO L93 Difference]: Finished difference Result 5695 states and 6050 transitions. [2018-07-24 01:21:51,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:21:51,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 260 [2018-07-24 01:21:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:51,539 INFO L225 Difference]: With dead ends: 5695 [2018-07-24 01:21:51,539 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 01:21:51,543 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:21:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 01:21:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 01:21:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 01:21:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 01:21:51,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2018-07-24 01:21:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:51,544 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 01:21:51,544 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:21:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 01:21:51,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 01:21:51,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 01:21:51,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:51,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:51,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:51,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:51,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:51,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:52,416 WARN L169 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2018-07-24 01:21:52,856 WARN L169 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2018-07-24 01:21:52,860 INFO L421 ceAbstractionStarter]: For program point L203''(lines 203 210) no Hoare annotation was computed. [2018-07-24 01:21:52,860 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 01:21:52,860 INFO L421 ceAbstractionStarter]: For program point L238''(lines 238 246) no Hoare annotation was computed. [2018-07-24 01:21:52,860 INFO L421 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-07-24 01:21:52,861 INFO L421 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,861 INFO L421 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-07-24 01:21:52,861 INFO L421 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,863 INFO L421 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-07-24 01:21:52,863 INFO L421 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,863 INFO L421 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-07-24 01:21:52,863 INFO L421 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-07-24 01:21:52,863 INFO L421 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,863 INFO L421 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,863 INFO L421 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-07-24 01:21:52,864 INFO L421 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,864 INFO L421 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-07-24 01:21:52,864 INFO L421 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,864 INFO L421 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-07-24 01:21:52,864 INFO L421 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,864 INFO L421 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-07-24 01:21:52,864 INFO L421 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-07-24 01:21:52,865 INFO L417 ceAbstractionStarter]: At program point L606''(lines 606 616) the Hoare annotation is: (let ((.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (let ((.cse0 (not .cse9)) (.cse11 (not .cse2)) (.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8))) (let ((.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse13 (and .cse0 .cse11 .cse1)) (.cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 11))) (.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 1)) (.cse14 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (let ((.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse5 (and .cse13 .cse6 .cse3 .cse14)) (.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse12 (not .cse4)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse1) (and .cse0 .cse4 .cse2 .cse3) (and .cse7 .cse8 .cse2) (and .cse7 .cse0 .cse6 .cse2) (and .cse9 .cse10 .cse3) (and .cse7 .cse9 .cse4 .cse11 .cse1) (and .cse7 .cse10 .cse11 .cse1) (and .cse7 .cse0 .cse8) (and .cse10 .cse5) (and .cse9 .cse11 .cse3 .cse1) (and .cse12 (and .cse7 .cse13)) (and .cse9 .cse11 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse12 .cse3) (and .cse8 .cse3 .cse1 .cse14)))))) [2018-07-24 01:21:52,866 INFO L421 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,866 INFO L421 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-07-24 01:21:52,866 INFO L421 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,866 INFO L421 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,866 INFO L421 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-07-24 01:21:52,866 INFO L421 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,867 INFO L421 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,867 INFO L421 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-07-24 01:21:52,867 INFO L421 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-07-24 01:21:52,867 INFO L421 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,867 INFO L421 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-07-24 01:21:52,867 INFO L421 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,867 INFO L421 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-07-24 01:21:52,867 INFO L421 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-07-24 01:21:52,868 INFO L421 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,869 INFO L421 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-07-24 01:21:52,869 INFO L421 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-07-24 01:21:52,869 INFO L421 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-07-24 01:21:52,869 INFO L421 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-07-24 01:21:52,869 INFO L421 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,869 INFO L421 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-07-24 01:21:52,869 INFO L421 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,869 INFO L421 ceAbstractionStarter]: For program point L332''(lines 332 335) no Hoare annotation was computed. [2018-07-24 01:21:52,869 INFO L421 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,870 INFO L421 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-07-24 01:21:52,870 INFO L421 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-07-24 01:21:52,870 INFO L421 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,870 INFO L421 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-07-24 01:21:52,870 INFO L421 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-07-24 01:21:52,870 INFO L421 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-07-24 01:21:52,870 INFO L421 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,870 INFO L421 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-07-24 01:21:52,870 INFO L421 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-07-24 01:21:52,871 INFO L421 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,871 INFO L421 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-07-24 01:21:52,871 INFO L421 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-07-24 01:21:52,871 INFO L421 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-07-24 01:21:52,871 INFO L421 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,871 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-07-24 01:21:52,871 INFO L421 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,871 INFO L421 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-07-24 01:21:52,872 INFO L421 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,872 INFO L421 ceAbstractionStarter]: For program point L298''(lines 298 307) no Hoare annotation was computed. [2018-07-24 01:21:52,872 INFO L421 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-07-24 01:21:52,872 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-07-24 01:21:52,872 INFO L421 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-07-24 01:21:52,872 INFO L421 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-07-24 01:21:52,872 INFO L421 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-07-24 01:21:52,872 INFO L421 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,872 INFO L421 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-07-24 01:21:52,873 INFO L417 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (let ((.cse0 (not .cse9)) (.cse11 (not .cse2)) (.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8))) (let ((.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse13 (and .cse0 .cse11 .cse1)) (.cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 11))) (.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 1)) (.cse14 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (let ((.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse5 (and .cse13 .cse6 .cse3 .cse14)) (.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse12 (not .cse4)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse1) (and .cse0 .cse4 .cse2 .cse3) (and .cse7 .cse8 .cse2) (and .cse7 .cse0 .cse6 .cse2) (and .cse9 .cse10 .cse3) (and .cse7 .cse9 .cse4 .cse11 .cse1) (and .cse7 .cse10 .cse11 .cse1) (and .cse7 .cse0 .cse8) (and .cse10 .cse5) (and .cse9 .cse11 .cse3 .cse1) (and .cse12 (and .cse7 .cse13)) (and .cse9 .cse11 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse12 .cse3) (and .cse8 .cse3 .cse1 .cse14)))))) [2018-07-24 01:21:52,873 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-07-24 01:21:52,873 INFO L421 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-07-24 01:21:52,873 INFO L421 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-07-24 01:21:52,873 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-07-24 01:21:52,874 INFO L421 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-07-24 01:21:52,875 INFO L421 ceAbstractionStarter]: For program point L75''(lines 75 80) no Hoare annotation was computed. [2018-07-24 01:21:52,875 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-07-24 01:21:52,875 INFO L421 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-07-24 01:21:52,875 INFO L421 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-07-24 01:21:52,875 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-07-24 01:21:52,875 INFO L421 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-07-24 01:21:52,875 INFO L421 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-07-24 01:21:52,875 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L381''(lines 381 387) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L315''(lines 315 326) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-07-24 01:21:52,876 INFO L421 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-07-24 01:21:52,877 INFO L421 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-07-24 01:21:52,878 INFO L424 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2018-07-24 01:21:52,878 INFO L421 ceAbstractionStarter]: For program point L606(lines 606 616) no Hoare annotation was computed. [2018-07-24 01:21:52,878 INFO L421 ceAbstractionStarter]: For program point L516'(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,878 INFO L421 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-07-24 01:21:52,878 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-07-24 01:21:52,878 INFO L421 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-07-24 01:21:52,878 INFO L421 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-07-24 01:21:52,878 INFO L421 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-07-24 01:21:52,878 INFO L421 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-07-24 01:21:52,878 INFO L421 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,879 INFO L421 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-07-24 01:21:52,880 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,881 INFO L421 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-07-24 01:21:52,882 INFO L421 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-07-24 01:21:52,882 INFO L421 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-07-24 01:21:52,882 INFO L421 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,882 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-07-24 01:21:52,882 INFO L421 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,882 INFO L421 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,882 INFO L421 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-07-24 01:21:52,882 INFO L421 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,882 INFO L421 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-07-24 01:21:52,883 INFO L421 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-07-24 01:21:52,884 INFO L421 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,884 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-07-24 01:21:52,884 INFO L421 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-07-24 01:21:52,884 INFO L421 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-07-24 01:21:52,884 INFO L421 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,884 INFO L421 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-07-24 01:21:52,884 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-07-24 01:21:52,884 INFO L421 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 517) no Hoare annotation was computed. [2018-07-24 01:21:52,885 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-07-24 01:21:52,886 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-07-24 01:21:52,886 INFO L421 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-07-24 01:21:52,886 INFO L421 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-07-24 01:21:52,886 INFO L421 ceAbstractionStarter]: For program point L83''(lines 83 89) no Hoare annotation was computed. [2018-07-24 01:21:52,886 INFO L421 ceAbstractionStarter]: For program point L338''(lines 338 347) no Hoare annotation was computed. [2018-07-24 01:21:52,886 INFO L421 ceAbstractionStarter]: For program point L262''(lines 262 274) no Hoare annotation was computed. [2018-07-24 01:21:52,886 INFO L421 ceAbstractionStarter]: For program point L414'(lines 29 598) no Hoare annotation was computed. [2018-07-24 01:21:52,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:21:52 BoogieIcfgContainer [2018-07-24 01:21:52,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:21:52,939 INFO L168 Benchmark]: Toolchain (without parser) took 32795.84 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -499.5 MB). Peak memory consumption was 624.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:52,940 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:21:52,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:52,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:21:52,942 INFO L168 Benchmark]: Boogie Preprocessor took 238.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:52,943 INFO L168 Benchmark]: RCFGBuilder took 3350.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.3 MB). Peak memory consumption was 119.3 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:52,944 INFO L168 Benchmark]: TraceAbstraction took 28380.14 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 351.3 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 196.1 MB). Peak memory consumption was 547.4 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:52,949 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 113.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 238.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3350.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.3 MB). Peak memory consumption was 119.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28380.14 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 351.3 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 196.1 MB). Peak memory consumption was 547.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 517]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10 && ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7 && ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10 && ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7 && ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 228 locations, 1 error locations. SAFE Result, 28.2s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 22.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1929 SDtfs, 3521 SDslu, 904 SDs, 0 SdLazy, 7681 SolverSat, 1496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 528 GetRequests, 498 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5008occurred in iteration=5, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 1412 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 64 NumberOfFragments, 483 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1868 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1536 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2392 NumberOfCodeBlocks, 2392 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2379 ConstructedInterpolants, 0 QuantifiedInterpolants, 986245 SizeOfPredicates, 7 NumberOfNonLiveVariables, 782 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1353/1361 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label00_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-21-52-994.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label00_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-21-52-994.csv Received shutdown request...