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_label29_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:20:07,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:20:07,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:20:07,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:20:07,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:20:07,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:20:07,494 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:20:07,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:20:07,498 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:20:07,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:20:07,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:20:07,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:20:07,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:20:07,504 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:20:07,505 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:20:07,506 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:20:07,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:20:07,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:20:07,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:20:07,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:20:07,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:20:07,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:20:07,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:20:07,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:20:07,535 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:20:07,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:20:07,539 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:20:07,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:20:07,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:20:07,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:20:07,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:20:07,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:20:07,545 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:20:07,545 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:20:07,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:20:07,549 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:20:07,549 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:07,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:20:07,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:20:07,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:20:07,576 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:20:07,577 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:20:07,578 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:20:07,578 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:20:07,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:20:07,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:20:07,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:20:07,579 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:20:07,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:20:07,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:20:07,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:20:07,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:20:07,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:20:07,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:20:07,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:20:07,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:20:07,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:20:07,583 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:20:07,583 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:20:07,583 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:20:07,584 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:20:07,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:20:07,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:20:07,584 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:20:07,584 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:20:07,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:20:07,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:20:07,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:20:07,675 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:20:07,676 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:20:07,677 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-07-24 01:20:08,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5337659/f1ac42792c9244d8b08f8af03ac1874f/FLAG3e56f9af4 [2018-07-24 01:20:08,305 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:20:08,307 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-07-24 01:20:08,328 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5337659/f1ac42792c9244d8b08f8af03ac1874f/FLAG3e56f9af4 [2018-07-24 01:20:08,344 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5337659/f1ac42792c9244d8b08f8af03ac1874f [2018-07-24 01:20:08,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:20:08,354 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:20:08,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:08,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:20:08,362 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:20:08,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:08,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77928ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08, skipping insertion in model container [2018-07-24 01:20:08,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:08,553 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:20:08,827 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:08,846 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:20:08,975 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:09,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:09 WrapperNode [2018-07-24 01:20:09,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:09,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:09,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:20:09,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:20:09,021 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:09" (1/1) ... [2018-07-24 01:20:09,044 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:09" (1/1) ... [2018-07-24 01:20:09,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:09,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:20:09,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:20:09,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:20:09,113 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:09" (1/1) ... [2018-07-24 01:20:09,113 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:09" (1/1) ... [2018-07-24 01:20:09,130 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:09" (1/1) ... [2018-07-24 01:20:09,130 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:09" (1/1) ... [2018-07-24 01:20:09,168 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:09" (1/1) ... [2018-07-24 01:20:09,303 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:09" (1/1) ... [2018-07-24 01:20:09,309 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:09" (1/1) ... [2018-07-24 01:20:09,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:20:09,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:20:09,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:20:09,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:20:09,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:09" (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:09,400 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:20:09,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:20:09,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:20:12,553 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:20:12,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:12 BoogieIcfgContainer [2018-07-24 01:20:12,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:20:12,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:20:12,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:20:12,567 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:20:12,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:20:08" (1/3) ... [2018-07-24 01:20:12,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cbab36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:12, skipping insertion in model container [2018-07-24 01:20:12,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:09" (2/3) ... [2018-07-24 01:20:12,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cbab36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:12, skipping insertion in model container [2018-07-24 01:20:12,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:12" (3/3) ... [2018-07-24 01:20:12,573 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2018-07-24 01:20:12,584 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:20:12,600 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:20:12,672 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:20:12,675 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:20:12,675 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:20:12,675 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:20:12,676 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:20:12,676 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:20:12,676 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:20:12,676 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:20:12,677 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:20:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-24 01:20:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-24 01:20:12,723 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:12,726 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:12,726 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash -450802649, now seen corresponding path program 1 times [2018-07-24 01:20:12,736 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:12,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:12,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:12,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:12,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:13,234 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:13,237 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:13,237 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:13,242 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:13,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:13,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:13,261 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-07-24 01:20:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:14,785 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-07-24 01:20:14,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:14,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-07-24 01:20:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:14,807 INFO L225 Difference]: With dead ends: 531 [2018-07-24 01:20:14,807 INFO L226 Difference]: Without dead ends: 328 [2018-07-24 01:20:14,812 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:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-07-24 01:20:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-07-24 01:20:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-07-24 01:20:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-07-24 01:20:14,882 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 102 [2018-07-24 01:20:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:14,883 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-07-24 01:20:14,883 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-07-24 01:20:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-24 01:20:14,888 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:14,888 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:14,888 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:14,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1964777089, now seen corresponding path program 1 times [2018-07-24 01:20:14,889 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:14,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:14,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:14,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:14,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:15,126 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:15,127 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:15,127 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:20:15,129 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:15,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:15,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:15,130 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 4 states. [2018-07-24 01:20:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:17,066 INFO L93 Difference]: Finished difference Result 1182 states and 1980 transitions. [2018-07-24 01:20:17,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:17,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-07-24 01:20:17,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:17,079 INFO L225 Difference]: With dead ends: 1182 [2018-07-24 01:20:17,079 INFO L226 Difference]: Without dead ends: 856 [2018-07-24 01:20:17,082 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:20:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-07-24 01:20:17,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-07-24 01:20:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-07-24 01:20:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1295 transitions. [2018-07-24 01:20:17,136 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1295 transitions. Word has length 107 [2018-07-24 01:20:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:17,137 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1295 transitions. [2018-07-24 01:20:17,137 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1295 transitions. [2018-07-24 01:20:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-24 01:20:17,143 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:17,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:17,144 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:17,144 INFO L82 PathProgramCache]: Analyzing trace with hash -676454088, now seen corresponding path program 1 times [2018-07-24 01:20:17,144 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:17,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:17,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:17,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:17,457 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:17,458 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:17,458 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:17,459 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:17,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:17,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:17,460 INFO L87 Difference]: Start difference. First operand 856 states and 1295 transitions. Second operand 4 states. [2018-07-24 01:20:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:20,391 INFO L93 Difference]: Finished difference Result 3319 states and 5077 transitions. [2018-07-24 01:20:20,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:20,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-07-24 01:20:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:20,408 INFO L225 Difference]: With dead ends: 3319 [2018-07-24 01:20:20,409 INFO L226 Difference]: Without dead ends: 2465 [2018-07-24 01:20:20,411 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2018-07-24 01:20:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 1648. [2018-07-24 01:20:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2018-07-24 01:20:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2323 transitions. [2018-07-24 01:20:20,455 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2323 transitions. Word has length 124 [2018-07-24 01:20:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:20,456 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2323 transitions. [2018-07-24 01:20:20,456 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2323 transitions. [2018-07-24 01:20:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-24 01:20:20,461 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:20,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:20,461 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash 300478156, now seen corresponding path program 1 times [2018-07-24 01:20:20,462 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:20,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:20,575 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:20,575 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:20,576 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:20,576 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:20,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:20,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:20,577 INFO L87 Difference]: Start difference. First operand 1648 states and 2323 transitions. Second operand 3 states. [2018-07-24 01:20:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:21,751 INFO L93 Difference]: Finished difference Result 3822 states and 5462 transitions. [2018-07-24 01:20:21,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:21,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-07-24 01:20:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:21,762 INFO L225 Difference]: With dead ends: 3822 [2018-07-24 01:20:21,762 INFO L226 Difference]: Without dead ends: 2176 [2018-07-24 01:20:21,765 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:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2018-07-24 01:20:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2176. [2018-07-24 01:20:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2018-07-24 01:20:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3045 transitions. [2018-07-24 01:20:21,809 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3045 transitions. Word has length 132 [2018-07-24 01:20:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:21,809 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 3045 transitions. [2018-07-24 01:20:21,809 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3045 transitions. [2018-07-24 01:20:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-24 01:20:21,814 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:21,814 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:21,814 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1355756906, now seen corresponding path program 1 times [2018-07-24 01:20:21,815 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:21,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:21,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:21,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:21,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-07-24 01:20:21,975 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:21,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:21,975 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:21,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:21,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:21,976 INFO L87 Difference]: Start difference. First operand 2176 states and 3045 transitions. Second operand 3 states. [2018-07-24 01:20:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:22,857 INFO L93 Difference]: Finished difference Result 4350 states and 6088 transitions. [2018-07-24 01:20:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:22,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-07-24 01:20:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:22,868 INFO L225 Difference]: With dead ends: 4350 [2018-07-24 01:20:22,868 INFO L226 Difference]: Without dead ends: 2176 [2018-07-24 01:20:22,872 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 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:20:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2018-07-24 01:20:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2176. [2018-07-24 01:20:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2018-07-24 01:20:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3021 transitions. [2018-07-24 01:20:22,912 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3021 transitions. Word has length 144 [2018-07-24 01:20:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:22,912 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 3021 transitions. [2018-07-24 01:20:22,912 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3021 transitions. [2018-07-24 01:20:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-24 01:20:22,917 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:22,918 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:22,918 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1159196757, now seen corresponding path program 1 times [2018-07-24 01:20:22,918 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:22,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:22,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:22,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-07-24 01:20:23,014 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:23,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:23,015 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:23,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:23,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:23,016 INFO L87 Difference]: Start difference. First operand 2176 states and 3021 transitions. Second operand 3 states. [2018-07-24 01:20:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:24,302 INFO L93 Difference]: Finished difference Result 6066 states and 8385 transitions. [2018-07-24 01:20:24,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:24,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-07-24 01:20:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:24,317 INFO L225 Difference]: With dead ends: 6066 [2018-07-24 01:20:24,318 INFO L226 Difference]: Without dead ends: 3892 [2018-07-24 01:20:24,321 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:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2018-07-24 01:20:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3892. [2018-07-24 01:20:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-07-24 01:20:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5094 transitions. [2018-07-24 01:20:24,392 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5094 transitions. Word has length 164 [2018-07-24 01:20:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:24,392 INFO L471 AbstractCegarLoop]: Abstraction has 3892 states and 5094 transitions. [2018-07-24 01:20:24,392 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5094 transitions. [2018-07-24 01:20:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-24 01:20:24,399 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:24,400 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:24,400 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:24,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1648893377, now seen corresponding path program 1 times [2018-07-24 01:20:24,400 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:24,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:24,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-07-24 01:20:24,580 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:24,580 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:24,580 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:24,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:24,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:24,583 INFO L87 Difference]: Start difference. First operand 3892 states and 5094 transitions. Second operand 3 states. [2018-07-24 01:20:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:25,534 INFO L93 Difference]: Finished difference Result 7782 states and 10186 transitions. [2018-07-24 01:20:25,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:25,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-07-24 01:20:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:25,550 INFO L225 Difference]: With dead ends: 7782 [2018-07-24 01:20:25,550 INFO L226 Difference]: Without dead ends: 3892 [2018-07-24 01:20:25,556 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:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2018-07-24 01:20:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3892. [2018-07-24 01:20:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-07-24 01:20:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5040 transitions. [2018-07-24 01:20:25,629 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5040 transitions. Word has length 166 [2018-07-24 01:20:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:25,630 INFO L471 AbstractCegarLoop]: Abstraction has 3892 states and 5040 transitions. [2018-07-24 01:20:25,630 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5040 transitions. [2018-07-24 01:20:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-24 01:20:25,638 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:25,638 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,639 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:25,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1579399063, now seen corresponding path program 1 times [2018-07-24 01:20:25,639 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:25,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:25,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:25,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:25,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:26,193 WARN L169 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-07-24 01:20:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-07-24 01:20:26,331 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:26,331 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-24 01:20:26,332 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 01:20:26,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 01:20:26,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-24 01:20:26,333 INFO L87 Difference]: Start difference. First operand 3892 states and 5040 transitions. Second operand 8 states. [2018-07-24 01:20:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:31,232 INFO L93 Difference]: Finished difference Result 8031 states and 10360 transitions. [2018-07-24 01:20:31,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 01:20:31,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2018-07-24 01:20:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:31,246 INFO L225 Difference]: With dead ends: 8031 [2018-07-24 01:20:31,246 INFO L226 Difference]: Without dead ends: 4141 [2018-07-24 01:20:31,250 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-24 01:20:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2018-07-24 01:20:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3892. [2018-07-24 01:20:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-07-24 01:20:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5022 transitions. [2018-07-24 01:20:31,315 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5022 transitions. Word has length 171 [2018-07-24 01:20:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:31,316 INFO L471 AbstractCegarLoop]: Abstraction has 3892 states and 5022 transitions. [2018-07-24 01:20:31,316 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 01:20:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5022 transitions. [2018-07-24 01:20:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-24 01:20:31,324 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:31,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:31,325 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:31,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1360664172, now seen corresponding path program 1 times [2018-07-24 01:20:31,325 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:31,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 181 proven. 27 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-07-24 01:20:31,680 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:20:31,680 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:20:31,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:31,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:20:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-07-24 01:20:32,059 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:20:32,059 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-07-24 01:20:32,060 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 01:20:32,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 01:20:32,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:20:32,061 INFO L87 Difference]: Start difference. First operand 3892 states and 5022 transitions. Second operand 7 states. [2018-07-24 01:20:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:35,754 INFO L93 Difference]: Finished difference Result 7258 states and 9344 transitions. [2018-07-24 01:20:35,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 01:20:35,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2018-07-24 01:20:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:35,768 INFO L225 Difference]: With dead ends: 7258 [2018-07-24 01:20:35,768 INFO L226 Difference]: Without dead ends: 3098 [2018-07-24 01:20:35,773 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-07-24 01:20:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2018-07-24 01:20:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 2818. [2018-07-24 01:20:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2018-07-24 01:20:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3146 transitions. [2018-07-24 01:20:35,828 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3146 transitions. Word has length 228 [2018-07-24 01:20:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:35,829 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 3146 transitions. [2018-07-24 01:20:35,829 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 01:20:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3146 transitions. [2018-07-24 01:20:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-24 01:20:35,836 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:35,837 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-07-24 01:20:35,837 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:35,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2050445195, now seen corresponding path program 1 times [2018-07-24 01:20:35,838 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:35,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:35,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:35,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:35,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-07-24 01:20:36,190 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:36,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:36,191 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:36,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:36,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:36,191 INFO L87 Difference]: Start difference. First operand 2818 states and 3146 transitions. Second operand 4 states. [2018-07-24 01:20:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:37,278 INFO L93 Difference]: Finished difference Result 5634 states and 6290 transitions. [2018-07-24 01:20:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:37,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-07-24 01:20:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:37,290 INFO L225 Difference]: With dead ends: 5634 [2018-07-24 01:20:37,291 INFO L226 Difference]: Without dead ends: 2818 [2018-07-24 01:20:37,293 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:20:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2018-07-24 01:20:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2018-07-24 01:20:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2018-07-24 01:20:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3141 transitions. [2018-07-24 01:20:37,336 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3141 transitions. Word has length 270 [2018-07-24 01:20:37,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:37,337 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 3141 transitions. [2018-07-24 01:20:37,337 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3141 transitions. [2018-07-24 01:20:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-24 01:20:37,344 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:37,345 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-07-24 01:20:37,345 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:37,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1266303110, now seen corresponding path program 1 times [2018-07-24 01:20:37,345 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:37,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:37,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:37,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:37,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:37,989 WARN L169 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-07-24 01:20:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-07-24 01:20:38,327 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:38,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 01:20:38,327 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 01:20:38,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 01:20:38,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:20:38,328 INFO L87 Difference]: Start difference. First operand 2818 states and 3141 transitions. Second operand 6 states. [2018-07-24 01:20:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:39,705 INFO L93 Difference]: Finished difference Result 5899 states and 6593 transitions. [2018-07-24 01:20:39,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 01:20:39,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 280 [2018-07-24 01:20:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:39,716 INFO L225 Difference]: With dead ends: 5899 [2018-07-24 01:20:39,716 INFO L226 Difference]: Without dead ends: 2142 [2018-07-24 01:20:39,719 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:20:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2018-07-24 01:20:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2142. [2018-07-24 01:20:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2018-07-24 01:20:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2341 transitions. [2018-07-24 01:20:39,751 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2341 transitions. Word has length 280 [2018-07-24 01:20:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:39,752 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 2341 transitions. [2018-07-24 01:20:39,752 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 01:20:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2341 transitions. [2018-07-24 01:20:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-24 01:20:39,759 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:39,759 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:39,759 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash 677596680, now seen corresponding path program 1 times [2018-07-24 01:20:39,760 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:39,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:39,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:39,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:39,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:40,209 WARN L169 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-24 01:20:40,521 WARN L169 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-07-24 01:20:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 304 proven. 97 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-24 01:20:40,889 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:20:40,889 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:20:40,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:41,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:20:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-07-24 01:20:41,231 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:20:41,231 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-07-24 01:20:41,232 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 01:20:41,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 01:20:41,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-07-24 01:20:41,233 INFO L87 Difference]: Start difference. First operand 2142 states and 2341 transitions. Second operand 11 states. [2018-07-24 01:20:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:45,559 INFO L93 Difference]: Finished difference Result 4554 states and 5004 transitions. [2018-07-24 01:20:45,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-24 01:20:45,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 300 [2018-07-24 01:20:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:45,560 INFO L225 Difference]: With dead ends: 4554 [2018-07-24 01:20:45,560 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 01:20:45,565 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-07-24 01:20:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 01:20:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 01:20:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 01:20:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 01:20:45,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 300 [2018-07-24 01:20:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:45,566 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 01:20:45,566 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 01:20:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 01:20:45,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 01:20:45,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 01:20:45,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:45,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:45,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:45,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:46,390 WARN L169 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2018-07-24 01:20:46,827 WARN L169 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2018-07-24 01:20:46,831 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-24 01:20:46,831 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-24 01:20:46,831 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-24 01:20:46,832 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-24 01:20:46,832 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-24 01:20:46,832 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 01:20:46,832 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-24 01:20:46,832 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-24 01:20:46,832 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 01:20:46,832 INFO L421 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,832 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-24 01:20:46,832 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-24 01:20:46,833 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,833 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,833 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-24 01:20:46,833 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-24 01:20:46,833 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,833 INFO L421 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,833 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,833 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-24 01:20:46,833 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,834 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-24 01:20:46,834 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,834 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-24 01:20:46,834 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-24 01:20:46,834 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,834 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-24 01:20:46,834 INFO L421 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,834 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-24 01:20:46,834 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,835 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,835 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-24 01:20:46,835 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,835 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,835 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-24 01:20:46,835 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,835 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-24 01:20:46,835 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,836 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-24 01:20:46,836 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,836 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-24 01:20:46,836 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,836 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-24 01:20:46,836 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,836 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-24 01:20:46,836 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-24 01:20:46,836 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-24 01:20:46,837 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,837 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-24 01:20:46,837 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,837 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-24 01:20:46,837 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-24 01:20:46,837 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,837 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-24 01:20:46,837 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,837 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-24 01:20:46,838 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,838 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,838 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-24 01:20:46,838 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,838 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-24 01:20:46,838 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,838 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-24 01:20:46,838 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-24 01:20:46,838 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-24 01:20:46,839 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-24 01:20:46,839 INFO L421 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,839 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-24 01:20:46,839 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,839 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-24 01:20:46,839 INFO L421 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,839 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-24 01:20:46,839 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-24 01:20:46,840 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-24 01:20:46,840 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,840 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-24 01:20:46,840 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,840 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-24 01:20:46,840 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-24 01:20:46,840 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-24 01:20:46,840 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,840 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,841 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-24 01:20:46,842 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,843 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-24 01:20:46,843 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-24 01:20:46,843 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-24 01:20:46,843 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,843 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-24 01:20:46,843 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,843 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-24 01:20:46,843 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-24 01:20:46,843 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-24 01:20:46,844 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,844 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-24 01:20:46,844 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-24 01:20:46,844 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-24 01:20:46,844 INFO L421 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,845 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (let ((.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse8 (not .cse0)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse1 (= ~__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__a16~0 4)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15) .cse0 .cse1 (not .cse2) .cse3 .cse4) (and .cse0 .cse1 (let ((.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0))) (or (and .cse5 .cse6) (and .cse6 .cse2)))) (and .cse7 .cse1 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse4) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5) .cse0 .cse1 .cse4) (and .cse7 .cse1 .cse8 .cse4) (and .cse8 .cse1 .cse2 .cse4) (and .cse5 .cse0 .cse1 .cse3 .cse4)))) [2018-07-24 01:20:46,845 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-24 01:20:46,845 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,845 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-24 01:20:46,845 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-24 01:20:46,845 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-24 01:20:46,845 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,845 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-24 01:20:46,845 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-24 01:20:46,846 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-24 01:20:46,847 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-24 01:20:46,848 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-24 01:20:46,849 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,850 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (let ((.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse8 (not .cse0)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse1 (= ~__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__a16~0 4)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15) .cse0 .cse1 (not .cse2) .cse3 .cse4) (and .cse0 .cse1 (let ((.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0))) (or (and .cse5 .cse6) (and .cse6 .cse2)))) (and .cse7 .cse1 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse4) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5) .cse0 .cse1 .cse4) (and .cse7 .cse1 .cse8 .cse4) (and .cse8 .cse1 .cse2 .cse4) (and .cse5 .cse0 .cse1 .cse3 .cse4)))) [2018-07-24 01:20:46,850 INFO L421 ceAbstractionStarter]: For program point L478'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,850 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-24 01:20:46,850 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-24 01:20:46,850 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-24 01:20:46,850 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-24 01:20:46,850 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-24 01:20:46,850 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-24 01:20:46,850 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,850 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 479) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-24 01:20:46,851 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-24 01:20:46,852 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-24 01:20:46,852 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-24 01:20:46,852 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-24 01:20:46,852 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-24 01:20:46,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:20:46 BoogieIcfgContainer [2018-07-24 01:20:46,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:20:46,886 INFO L168 Benchmark]: Toolchain (without parser) took 38532.40 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: -491.3 MB). Peak memory consumption was 705.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:46,887 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:20:46,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.53 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:20:46,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.48 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:20:46,889 INFO L168 Benchmark]: Boogie Preprocessor took 221.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -875.1 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:46,890 INFO L168 Benchmark]: RCFGBuilder took 3239.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 118.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:46,891 INFO L168 Benchmark]: TraceAbstraction took 34326.56 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 413.7 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 212.5 MB). Peak memory consumption was 626.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:46,896 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 655.53 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 84.48 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.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -875.1 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3239.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 118.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34326.56 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 413.7 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 212.5 MB). Peak memory consumption was 626.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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__a8 == 15 && __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__a17 == 1)) && __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__a20 == 1 && __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__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__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__a20 == 1 && __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__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__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 == 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__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__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__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__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__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - 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__a8 == 15 && __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__a17 == 1)) && __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__a20 == 1 && __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__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__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__a20 == 1 && __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__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__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 == 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__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__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__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__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__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - 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, 34.1s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 26.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1313 SDtfs, 4709 SDslu, 961 SDs, 0 SdLazy, 11691 SolverSat, 1548 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 545 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3892occurred in iteration=6, 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.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1346 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 65 NumberOfFragments, 253 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3254 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 566 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2716 NumberOfCodeBlocks, 2716 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2702 ConstructedInterpolants, 0 QuantifiedInterpolants, 2143058 SizeOfPredicates, 2 NumberOfNonLiveVariables, 936 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2681/2805 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_label29_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-20-46-924.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label29_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-20-46-924.csv Received shutdown request...