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/Problem01_label41_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:20:42,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:20:42,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:20:42,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:20:42,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:20:42,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:20:42,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:20:42,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:20:42,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:20:42,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:20:42,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:20:42,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:20:42,264 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:20:42,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:20:42,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:20:42,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:20:42,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:20:42,278 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:20:42,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:20:42,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:20:42,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:20:42,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:20:42,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:20:42,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:20:42,295 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:20:42,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:20:42,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:20:42,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:20:42,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:20:42,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:20:42,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:20:42,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:20:42,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:20:42,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:20:42,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:20:42,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:20:42,305 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:20:42,332 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:20:42,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:20:42,334 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:20:42,334 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:20:42,338 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:20:42,338 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:20:42,338 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:20:42,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:20:42,339 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:20:42,339 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:20:42,339 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:20:42,339 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:20:42,340 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:20:42,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:20:42,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:20:42,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:20:42,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:20:42,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:20:42,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:20:42,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:20:42,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:20:42,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:20:42,344 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:20:42,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:20:42,344 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:20:42,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:20:42,344 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:20:42,345 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:20:42,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:20:42,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:20:42,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:20:42,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:20:42,434 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:20:42,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.c [2018-07-24 01:20:42,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe68e7d5/3326d66bad1f40a9bdcea3d3a427404d/FLAG50e50e073 [2018-07-24 01:20:43,090 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:20:43,091 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.c [2018-07-24 01:20:43,113 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe68e7d5/3326d66bad1f40a9bdcea3d3a427404d/FLAG50e50e073 [2018-07-24 01:20:43,133 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe68e7d5/3326d66bad1f40a9bdcea3d3a427404d [2018-07-24 01:20:43,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:20:43,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:20:43,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:43,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:20:43,154 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:20:43,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:43,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c0516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43, skipping insertion in model container [2018-07-24 01:20:43,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:43,364 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:20:43,623 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:43,645 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:20:43,790 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:43,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43 WrapperNode [2018-07-24 01:20:43,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:43,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:43,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:20:43,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:20:43,844 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:20:43" (1/1) ... [2018-07-24 01:20:43,870 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:20:43" (1/1) ... [2018-07-24 01:20:43,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:43,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:20:43,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:20:43,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:20:43,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:43,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:43,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:43,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:43,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:44,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:44,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:44,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:20:44,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:20:44,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:20:44,167 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:20:44,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43" (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:20:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:20:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:20:44,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:20:47,404 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:20:47,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:47 BoogieIcfgContainer [2018-07-24 01:20:47,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:20:47,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:20:47,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:20:47,419 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:20:47,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:20:43" (1/3) ... [2018-07-24 01:20:47,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ace701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:47, skipping insertion in model container [2018-07-24 01:20:47,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43" (2/3) ... [2018-07-24 01:20:47,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ace701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:47, skipping insertion in model container [2018-07-24 01:20:47,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:47" (3/3) ... [2018-07-24 01:20:47,427 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label41_true-unreach-call_false-termination.c [2018-07-24 01:20:47,451 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:20:47,468 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:20:47,539 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:20:47,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:20:47,540 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:20:47,543 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:20:47,543 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:20:47,543 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:20:47,544 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:20:47,544 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:20:47,544 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:20:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-24 01:20:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-24 01:20:47,596 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:47,597 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] [2018-07-24 01:20:47,598 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash -860673049, now seen corresponding path program 1 times [2018-07-24 01:20:47,607 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:47,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:47,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:47,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:48,078 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:20:48,081 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:48,082 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:48,087 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:48,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:48,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:48,106 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-07-24 01:20:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:49,655 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-07-24 01:20:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:49,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-07-24 01:20:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:49,677 INFO L225 Difference]: With dead ends: 531 [2018-07-24 01:20:49,677 INFO L226 Difference]: Without dead ends: 328 [2018-07-24 01:20:49,682 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:20:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-07-24 01:20:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-07-24 01:20:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-07-24 01:20:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-07-24 01:20:49,753 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 86 [2018-07-24 01:20:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:49,754 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-07-24 01:20:49,754 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-07-24 01:20:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-24 01:20:49,759 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:49,759 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] [2018-07-24 01:20:49,760 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash -12881601, now seen corresponding path program 1 times [2018-07-24 01:20:49,760 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:49,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:49,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:50,059 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:50,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:20:50,062 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:50,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:50,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:50,063 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 4 states. [2018-07-24 01:20:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:51,833 INFO L93 Difference]: Finished difference Result 1182 states and 1980 transitions. [2018-07-24 01:20:51,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:51,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-07-24 01:20:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:51,849 INFO L225 Difference]: With dead ends: 1182 [2018-07-24 01:20:51,850 INFO L226 Difference]: Without dead ends: 856 [2018-07-24 01:20:51,854 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:20:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-07-24 01:20:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-07-24 01:20:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-07-24 01:20:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1295 transitions. [2018-07-24 01:20:51,922 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1295 transitions. Word has length 91 [2018-07-24 01:20:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:51,922 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1295 transitions. [2018-07-24 01:20:51,923 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1295 transitions. [2018-07-24 01:20:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-24 01:20:51,935 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:51,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,935 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:51,938 INFO L82 PathProgramCache]: Analyzing trace with hash 654721784, now seen corresponding path program 1 times [2018-07-24 01:20:51,938 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:51,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:51,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:52,214 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:52,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:52,215 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:52,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:52,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:52,218 INFO L87 Difference]: Start difference. First operand 856 states and 1295 transitions. Second operand 4 states. [2018-07-24 01:20:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:55,158 INFO L93 Difference]: Finished difference Result 3320 states and 5077 transitions. [2018-07-24 01:20:55,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:55,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-07-24 01:20:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:55,171 INFO L225 Difference]: With dead ends: 3320 [2018-07-24 01:20:55,171 INFO L226 Difference]: Without dead ends: 2466 [2018-07-24 01:20:55,173 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:20:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-07-24 01:20:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1648. [2018-07-24 01:20:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2018-07-24 01:20:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2323 transitions. [2018-07-24 01:20:55,216 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2323 transitions. Word has length 108 [2018-07-24 01:20:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:55,217 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2323 transitions. [2018-07-24 01:20:55,217 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2323 transitions. [2018-07-24 01:20:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-24 01:20:55,221 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:55,221 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-07-24 01:20:55,221 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1456067590, now seen corresponding path program 1 times [2018-07-24 01:20:55,222 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:55,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:55,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:55,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:55,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 01:20:55,322 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:55,322 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:55,323 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:55,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:55,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:55,323 INFO L87 Difference]: Start difference. First operand 1648 states and 2323 transitions. Second operand 3 states. [2018-07-24 01:20:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:56,874 INFO L93 Difference]: Finished difference Result 4878 states and 6904 transitions. [2018-07-24 01:20:56,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:56,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-07-24 01:20:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:56,892 INFO L225 Difference]: With dead ends: 4878 [2018-07-24 01:20:56,893 INFO L226 Difference]: Without dead ends: 3232 [2018-07-24 01:20:56,896 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:20:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-07-24 01:20:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3232. [2018-07-24 01:20:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3232 states. [2018-07-24 01:20:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4385 transitions. [2018-07-24 01:20:56,965 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4385 transitions. Word has length 114 [2018-07-24 01:20:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:56,965 INFO L471 AbstractCegarLoop]: Abstraction has 3232 states and 4385 transitions. [2018-07-24 01:20:56,965 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4385 transitions. [2018-07-24 01:20:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-24 01:20:56,970 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:56,971 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-07-24 01:20:56,971 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:56,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1016510604, now seen corresponding path program 1 times [2018-07-24 01:20:56,971 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:56,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:56,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:56,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:20:57,088 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:57,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:57,089 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:57,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:57,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:57,090 INFO L87 Difference]: Start difference. First operand 3232 states and 4385 transitions. Second operand 3 states. [2018-07-24 01:20:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:57,968 INFO L93 Difference]: Finished difference Result 7122 states and 9717 transitions. [2018-07-24 01:20:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:57,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-07-24 01:20:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:57,985 INFO L225 Difference]: With dead ends: 7122 [2018-07-24 01:20:57,985 INFO L226 Difference]: Without dead ends: 3892 [2018-07-24 01:20:57,990 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:20:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2018-07-24 01:20:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3892. [2018-07-24 01:20:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-07-24 01:20:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5142 transitions. [2018-07-24 01:20:58,062 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5142 transitions. Word has length 116 [2018-07-24 01:20:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:58,063 INFO L471 AbstractCegarLoop]: Abstraction has 3892 states and 5142 transitions. [2018-07-24 01:20:58,063 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5142 transitions. [2018-07-24 01:20:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-24 01:20:58,068 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:58,068 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, 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] [2018-07-24 01:20:58,068 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1125921692, now seen corresponding path program 1 times [2018-07-24 01:20:58,069 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:58,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:58,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:58,232 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:58,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:58,232 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:58,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:58,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:58,233 INFO L87 Difference]: Start difference. First operand 3892 states and 5142 transitions. Second operand 3 states. [2018-07-24 01:20:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:59,288 INFO L93 Difference]: Finished difference Result 7782 states and 10282 transitions. [2018-07-24 01:20:59,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:59,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-07-24 01:20:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:59,310 INFO L225 Difference]: With dead ends: 7782 [2018-07-24 01:20:59,310 INFO L226 Difference]: Without dead ends: 3892 [2018-07-24 01:20:59,314 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:20:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2018-07-24 01:20:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3892. [2018-07-24 01:20:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-07-24 01:20:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5088 transitions. [2018-07-24 01:20:59,375 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5088 transitions. Word has length 116 [2018-07-24 01:20:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:59,376 INFO L471 AbstractCegarLoop]: Abstraction has 3892 states and 5088 transitions. [2018-07-24 01:20:59,376 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5088 transitions. [2018-07-24 01:20:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-24 01:20:59,381 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:59,381 INFO L353 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,381 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1083562052, now seen corresponding path program 1 times [2018-07-24 01:20:59,382 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:59,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:59,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:59,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:59,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:59,613 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:59,613 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-24 01:20:59,614 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 01:20:59,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 01:20:59,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-24 01:20:59,614 INFO L87 Difference]: Start difference. First operand 3892 states and 5088 transitions. Second operand 8 states. [2018-07-24 01:21:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:01,869 INFO L93 Difference]: Finished difference Result 8031 states and 10456 transitions. [2018-07-24 01:21:01,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 01:21:01,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 121 [2018-07-24 01:21:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:01,883 INFO L225 Difference]: With dead ends: 8031 [2018-07-24 01:21:01,883 INFO L226 Difference]: Without dead ends: 4141 [2018-07-24 01:21:01,887 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-24 01:21:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2018-07-24 01:21:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3892. [2018-07-24 01:21:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-07-24 01:21:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5070 transitions. [2018-07-24 01:21:02,002 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5070 transitions. Word has length 121 [2018-07-24 01:21:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:02,003 INFO L471 AbstractCegarLoop]: Abstraction has 3892 states and 5070 transitions. [2018-07-24 01:21:02,003 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 01:21:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5070 transitions. [2018-07-24 01:21:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-24 01:21:02,008 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:02,009 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 01:21:02,009 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash -595674659, now seen corresponding path program 1 times [2018-07-24 01:21:02,009 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:02,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:02,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:02,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-24 01:21:02,196 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:02,196 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:02,196 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:02,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:02,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:02,197 INFO L87 Difference]: Start difference. First operand 3892 states and 5070 transitions. Second operand 4 states. [2018-07-24 01:21:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:04,110 INFO L93 Difference]: Finished difference Result 7782 states and 10138 transitions. [2018-07-24 01:21:04,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:04,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-07-24 01:21:04,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:04,117 INFO L225 Difference]: With dead ends: 7782 [2018-07-24 01:21:04,117 INFO L226 Difference]: Without dead ends: 2272 [2018-07-24 01:21:04,121 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:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-07-24 01:21:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2272. [2018-07-24 01:21:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2018-07-24 01:21:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2684 transitions. [2018-07-24 01:21:04,157 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2684 transitions. Word has length 138 [2018-07-24 01:21:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:04,157 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2684 transitions. [2018-07-24 01:21:04,157 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2684 transitions. [2018-07-24 01:21:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-24 01:21:04,162 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:04,162 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,162 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:04,163 INFO L82 PathProgramCache]: Analyzing trace with hash 216807565, now seen corresponding path program 1 times [2018-07-24 01:21:04,163 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:04,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:04,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:04,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:04,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-07-24 01:21:04,358 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:04,358 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:04,358 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:04,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:04,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:04,359 INFO L87 Difference]: Start difference. First operand 2272 states and 2684 transitions. Second operand 4 states. [2018-07-24 01:21:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:05,024 INFO L93 Difference]: Finished difference Result 4542 states and 5366 transitions. [2018-07-24 01:21:05,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:05,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-07-24 01:21:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:05,033 INFO L225 Difference]: With dead ends: 4542 [2018-07-24 01:21:05,033 INFO L226 Difference]: Without dead ends: 2272 [2018-07-24 01:21:05,035 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-07-24 01:21:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2272. [2018-07-24 01:21:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2018-07-24 01:21:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2587 transitions. [2018-07-24 01:21:05,067 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2587 transitions. Word has length 154 [2018-07-24 01:21:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:05,068 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2587 transitions. [2018-07-24 01:21:05,068 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2587 transitions. [2018-07-24 01:21:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-24 01:21:05,072 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:05,073 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,073 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1360379170, now seen corresponding path program 1 times [2018-07-24 01:21:05,073 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:05,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:05,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:05,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:05,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-07-24 01:21:05,249 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:05,249 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:05,249 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:05,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:05,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:05,250 INFO L87 Difference]: Start difference. First operand 2272 states and 2587 transitions. Second operand 4 states. [2018-07-24 01:21:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:06,736 INFO L93 Difference]: Finished difference Result 7446 states and 8418 transitions. [2018-07-24 01:21:06,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:06,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-07-24 01:21:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:06,769 INFO L225 Difference]: With dead ends: 7446 [2018-07-24 01:21:06,769 INFO L226 Difference]: Without dead ends: 5176 [2018-07-24 01:21:06,772 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:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2018-07-24 01:21:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 5176. [2018-07-24 01:21:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5176 states. [2018-07-24 01:21:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5176 states to 5176 states and 5729 transitions. [2018-07-24 01:21:06,845 INFO L78 Accepts]: Start accepts. Automaton has 5176 states and 5729 transitions. Word has length 160 [2018-07-24 01:21:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:06,845 INFO L471 AbstractCegarLoop]: Abstraction has 5176 states and 5729 transitions. [2018-07-24 01:21:06,845 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5176 states and 5729 transitions. [2018-07-24 01:21:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-24 01:21:06,852 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:06,852 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,853 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash 890262447, now seen corresponding path program 1 times [2018-07-24 01:21:06,853 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:06,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:06,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:07,305 WARN L169 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-07-24 01:21:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-07-24 01:21:07,329 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:07,329 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:07,329 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:21:07,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:21:07,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:21:07,330 INFO L87 Difference]: Start difference. First operand 5176 states and 5729 transitions. Second operand 5 states. [2018-07-24 01:21:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:08,572 INFO L93 Difference]: Finished difference Result 11148 states and 12319 transitions. [2018-07-24 01:21:08,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:21:08,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2018-07-24 01:21:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:08,587 INFO L225 Difference]: With dead ends: 11148 [2018-07-24 01:21:08,587 INFO L226 Difference]: Without dead ends: 6106 [2018-07-24 01:21:08,593 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:21:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6106 states. [2018-07-24 01:21:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6106 to 5044. [2018-07-24 01:21:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5044 states. [2018-07-24 01:21:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 5561 transitions. [2018-07-24 01:21:08,672 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 5561 transitions. Word has length 182 [2018-07-24 01:21:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:08,672 INFO L471 AbstractCegarLoop]: Abstraction has 5044 states and 5561 transitions. [2018-07-24 01:21:08,672 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:21:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 5561 transitions. [2018-07-24 01:21:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-24 01:21:08,679 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:08,680 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,680 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1588912084, now seen corresponding path program 1 times [2018-07-24 01:21:08,681 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:08,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:08,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:08,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:08,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:09,206 WARN L169 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-07-24 01:21:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-07-24 01:21:09,312 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:09,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:09,313 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:09,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:09,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:09,314 INFO L87 Difference]: Start difference. First operand 5044 states and 5561 transitions. Second operand 4 states. [2018-07-24 01:21:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:10,426 INFO L93 Difference]: Finished difference Result 9954 states and 10977 transitions. [2018-07-24 01:21:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:10,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2018-07-24 01:21:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:10,435 INFO L225 Difference]: With dead ends: 9954 [2018-07-24 01:21:10,435 INFO L226 Difference]: Without dead ends: 5044 [2018-07-24 01:21:10,440 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2018-07-24 01:21:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 4645. [2018-07-24 01:21:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4645 states. [2018-07-24 01:21:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4645 states to 4645 states and 5029 transitions. [2018-07-24 01:21:10,496 INFO L78 Accepts]: Start accepts. Automaton has 4645 states and 5029 transitions. Word has length 212 [2018-07-24 01:21:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:10,497 INFO L471 AbstractCegarLoop]: Abstraction has 4645 states and 5029 transitions. [2018-07-24 01:21:10,497 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4645 states and 5029 transitions. [2018-07-24 01:21:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-24 01:21:10,502 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:10,503 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,503 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:10,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1924238531, now seen corresponding path program 1 times [2018-07-24 01:21:10,503 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:10,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:10,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-07-24 01:21:10,809 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:10,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:10,810 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:10,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:10,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:10,811 INFO L87 Difference]: Start difference. First operand 4645 states and 5029 transitions. Second operand 4 states. [2018-07-24 01:21:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:11,717 INFO L93 Difference]: Finished difference Result 9420 states and 10209 transitions. [2018-07-24 01:21:11,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:11,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2018-07-24 01:21:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:11,726 INFO L225 Difference]: With dead ends: 9420 [2018-07-24 01:21:11,726 INFO L226 Difference]: Without dead ends: 4909 [2018-07-24 01:21:11,730 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:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2018-07-24 01:21:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 4513. [2018-07-24 01:21:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4513 states. [2018-07-24 01:21:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 4806 transitions. [2018-07-24 01:21:11,785 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 4806 transitions. Word has length 218 [2018-07-24 01:21:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:11,786 INFO L471 AbstractCegarLoop]: Abstraction has 4513 states and 4806 transitions. [2018-07-24 01:21:11,786 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 4806 transitions. [2018-07-24 01:21:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-24 01:21:11,792 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:11,792 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,792 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:11,792 INFO L82 PathProgramCache]: Analyzing trace with hash 65344172, now seen corresponding path program 1 times [2018-07-24 01:21:11,792 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:11,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:11,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-07-24 01:21:12,045 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:12,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:12,045 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:21:12,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:21:12,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:12,046 INFO L87 Difference]: Start difference. First operand 4513 states and 4806 transitions. Second operand 3 states. [2018-07-24 01:21:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:13,329 INFO L93 Difference]: Finished difference Result 8492 states and 9049 transitions. [2018-07-24 01:21:13,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:13,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-07-24 01:21:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:13,338 INFO L225 Difference]: With dead ends: 8492 [2018-07-24 01:21:13,338 INFO L226 Difference]: Without dead ends: 4113 [2018-07-24 01:21:13,343 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-07-24 01:21:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3981. [2018-07-24 01:21:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2018-07-24 01:21:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4196 transitions. [2018-07-24 01:21:13,392 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4196 transitions. Word has length 228 [2018-07-24 01:21:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:13,392 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 4196 transitions. [2018-07-24 01:21:13,393 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:21:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4196 transitions. [2018-07-24 01:21:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-24 01:21:13,397 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:13,398 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:13,398 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash -390451273, now seen corresponding path program 1 times [2018-07-24 01:21:13,398 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:13,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:13,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:13,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:13,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:13,812 WARN L169 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-24 01:21:14,007 WARN L169 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-07-24 01:21:14,442 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-07-24 01:21:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 283 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-24 01:21:14,933 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:21:14,933 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:14,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:15,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:21:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-07-24 01:21:15,400 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:21:15,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-07-24 01:21:15,401 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-24 01:21:15,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-24 01:21:15,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-07-24 01:21:15,402 INFO L87 Difference]: Start difference. First operand 3981 states and 4196 transitions. Second operand 14 states. [2018-07-24 01:21:18,819 WARN L169 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-07-24 01:21:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:20,550 INFO L93 Difference]: Finished difference Result 7219 states and 7620 transitions. [2018-07-24 01:21:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-24 01:21:20,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 262 [2018-07-24 01:21:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:20,551 INFO L225 Difference]: With dead ends: 7219 [2018-07-24 01:21:20,551 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 01:21:20,555 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-07-24 01:21:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 01:21:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 01:21:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 01:21:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 01:21:20,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 262 [2018-07-24 01:21:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:20,556 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 01:21:20,556 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-24 01:21:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 01:21:20,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 01:21:20,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 01:21:20,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:20,683 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 67 [2018-07-24 01:21:20,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:20,792 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 67 [2018-07-24 01:21:22,180 WARN L169 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-07-24 01:21:22,960 WARN L169 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-07-24 01:21:22,964 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-24 01:21:22,964 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-24 01:21:22,964 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-24 01:21:22,964 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-24 01:21:22,964 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-24 01:21:22,964 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 01:21:22,964 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-24 01:21:22,964 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-24 01:21:22,964 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-24 01:21:22,965 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-24 01:21:22,966 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,967 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,967 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-24 01:21:22,967 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,967 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-24 01:21:22,967 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,967 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-24 01:21:22,967 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,967 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-24 01:21:22,967 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-24 01:21:22,968 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-24 01:21:22,969 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,969 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-24 01:21:22,969 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,969 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-24 01:21:22,969 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,969 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,969 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-24 01:21:22,969 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,969 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-24 01:21:22,970 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,970 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-24 01:21:22,970 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-24 01:21:22,970 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-24 01:21:22,970 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-24 01:21:22,970 INFO L421 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,970 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-24 01:21:22,970 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,970 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-24 01:21:22,971 INFO L421 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,971 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-24 01:21:22,971 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-24 01:21:22,971 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-24 01:21:22,971 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,971 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-24 01:21:22,971 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,971 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-24 01:21:22,971 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-24 01:21:22,972 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-24 01:21:22,973 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-24 01:21:22,974 INFO L421 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,975 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (.cse11 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4)) (.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse6 .cse8) (and .cse1 .cse2 .cse3 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 6) .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 (or (= 5 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input) (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 4)) .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse2 .cse4 .cse8) (and .cse10 .cse7 .cse2 .cse8) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5) (and (and .cse10 .cse4 .cse8) .cse2) (and (not .cse5) .cse7 .cse11 .cse2 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 2)) (and .cse1 .cse8) (and .cse0 .cse7 .cse2 .cse3))) [2018-07-24 01:21:22,975 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-24 01:21:22,975 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,975 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-24 01:21:22,975 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-24 01:21:22,976 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-24 01:21:22,976 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,976 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-24 01:21:22,976 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-24 01:21:22,976 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-24 01:21:22,976 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-24 01:21:22,976 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-24 01:21:22,976 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-24 01:21:22,976 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,977 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-24 01:21:22,977 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-24 01:21:22,977 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,977 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-24 01:21:22,977 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-24 01:21:22,977 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-24 01:21:22,977 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,977 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-24 01:21:22,978 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-24 01:21:22,978 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,978 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,978 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-24 01:21:22,978 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-24 01:21:22,978 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-24 01:21:22,978 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,978 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-24 01:21:22,978 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-24 01:21:22,979 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-24 01:21:22,979 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-24 01:21:22,979 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-24 01:21:22,979 INFO L421 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,979 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-24 01:21:22,979 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-24 01:21:22,979 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-24 01:21:22,979 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-24 01:21:22,979 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-24 01:21:22,980 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-24 01:21:22,980 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-24 01:21:22,980 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-24 01:21:22,980 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-24 01:21:22,980 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-24 01:21:22,980 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-24 01:21:22,980 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-24 01:21:22,980 INFO L421 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,980 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-24 01:21:22,981 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-24 01:21:22,981 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-24 01:21:22,981 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-24 01:21:22,981 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-24 01:21:22,981 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,981 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-24 01:21:22,981 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,982 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (.cse11 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4)) (.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse6 .cse8) (and .cse1 .cse2 .cse3 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 6) .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 (or (= 5 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input) (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 4)) .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse2 .cse4 .cse8) (and .cse10 .cse7 .cse2 .cse8) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5) (and (and .cse10 .cse4 .cse8) .cse2) (and (not .cse5) .cse7 .cse11 .cse2 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 2)) (and .cse1 .cse8) (and .cse0 .cse7 .cse2 .cse3))) [2018-07-24 01:21:22,982 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-24 01:21:22,982 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-24 01:21:22,982 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-24 01:21:22,982 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-24 01:21:22,982 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-24 01:21:22,982 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-24 01:21:22,982 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,982 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-24 01:21:22,983 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-24 01:21:22,983 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-24 01:21:22,983 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,983 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 431) no Hoare annotation was computed. [2018-07-24 01:21:22,983 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 01:21:22,983 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-24 01:21:22,983 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-24 01:21:22,983 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-24 01:21:22,983 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L430'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-24 01:21:22,984 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-24 01:21:23,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:21:23 BoogieIcfgContainer [2018-07-24 01:21:23,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:21:23,015 INFO L168 Benchmark]: Toolchain (without parser) took 39869.91 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -480.8 MB). Peak memory consumption was 716.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:23,016 INFO L168 Benchmark]: CDTParser took 0.22 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:23,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.41 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:23,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.21 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:23,018 INFO L168 Benchmark]: Boogie Preprocessor took 221.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.8 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:23,019 INFO L168 Benchmark]: RCFGBuilder took 3241.42 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: 120.9 MB). Peak memory consumption was 120.9 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:23,020 INFO L168 Benchmark]: TraceAbstraction took 35605.05 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 453.5 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 183.2 MB). Peak memory consumption was 636.7 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:23,026 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.22 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 685.41 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 111.21 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 221.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.8 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3241.42 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: 120.9 MB). Peak memory consumption was 120.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35605.05 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 453.5 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 183.2 MB). Peak memory consumption was 636.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 431]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __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__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && input == 6) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && (5 == input || input == 4)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 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__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __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__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 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__a12 == 8)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __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__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && input == 2)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 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__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __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__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && input == 6) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && (5 == input || input == 4)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 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__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __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__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 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__a12 == 8)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __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__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && input == 2)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 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__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 35.4s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 26.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1974 SDtfs, 4581 SDslu, 898 SDs, 0 SdLazy, 10729 SolverSat, 1668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 285 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5176occurred in iteration=10, 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.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 3056 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 85 NumberOfFragments, 429 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5600 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 300 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2568 NumberOfCodeBlocks, 2568 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2552 ConstructedInterpolants, 0 QuantifiedInterpolants, 1501931 SizeOfPredicates, 1 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 2219/2224 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/Problem01_label41_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-21-23-076.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label41_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-21-23-076.csv Received shutdown request...