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_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:19:16,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:19:16,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:19:16,552 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:19:16,552 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:19:16,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:19:16,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:19:16,557 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:19:16,559 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:19:16,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:19:16,560 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:19:16,561 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:19:16,562 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:19:16,562 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:19:16,564 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:19:16,564 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:19:16,565 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:19:16,567 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:19:16,569 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:19:16,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:19:16,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:19:16,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:19:16,576 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:19:16,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:19:16,577 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:19:16,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:19:16,579 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:19:16,580 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:19:16,581 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:19:16,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:19:16,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:19:16,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:19:16,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:19:16,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:19:16,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:19:16,587 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:19:16,588 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:19:16,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:19:16,620 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:19:16,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:19:16,621 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:19:16,622 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:19:16,622 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:19:16,622 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:19:16,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:19:16,623 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:19:16,623 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:19:16,623 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:19:16,623 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:19:16,623 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:19:16,624 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:19:16,624 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:19:16,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:19:16,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:19:16,626 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:19:16,626 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:19:16,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:19:16,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:19:16,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:19:16,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:19:16,627 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:19:16,627 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:19:16,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:19:16,628 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:19:16,628 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:19:16,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:19:16,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:19:16,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:19:16,700 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:19:16,700 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:19:16,702 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-07-24 01:19:17,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ace270ec/c0e9469447684c4bb6afef857e9c6cdd/FLAG399fc2b4b [2018-07-24 01:19:17,313 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:19:17,314 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-07-24 01:19:17,334 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ace270ec/c0e9469447684c4bb6afef857e9c6cdd/FLAG399fc2b4b [2018-07-24 01:19:17,349 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ace270ec/c0e9469447684c4bb6afef857e9c6cdd [2018-07-24 01:19:17,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:19:17,360 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:19:17,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:19:17,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:19:17,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:19:17,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:19:17" (1/1) ... [2018-07-24 01:19:17,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47db165b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:17, skipping insertion in model container [2018-07-24 01:19:17,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:19:17" (1/1) ... [2018-07-24 01:19:17,604 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:19:17,919 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:19:17,938 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:19:18,024 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:19:18,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18 WrapperNode [2018-07-24 01:19:18,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:19:18,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:19:18,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:19:18,070 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:19:18,081 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:19:18" (1/1) ... [2018-07-24 01:19:18,104 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:19:18" (1/1) ... [2018-07-24 01:19:18,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:19:18,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:19:18,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:19:18,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:19:18,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18" (1/1) ... [2018-07-24 01:19:18,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18" (1/1) ... [2018-07-24 01:19:18,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18" (1/1) ... [2018-07-24 01:19:18,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18" (1/1) ... [2018-07-24 01:19:18,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18" (1/1) ... [2018-07-24 01:19:18,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18" (1/1) ... [2018-07-24 01:19:18,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18" (1/1) ... [2018-07-24 01:19:18,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:19:18,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:19:18,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:19:18,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:19:18,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18" (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:19:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:19:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:19:18,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:19:21,490 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:19:21,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:19:21 BoogieIcfgContainer [2018-07-24 01:19:21,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:19:21,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:19:21,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:19:21,496 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:19:21,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:19:17" (1/3) ... [2018-07-24 01:19:21,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d3e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:19:21, skipping insertion in model container [2018-07-24 01:19:21,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:18" (2/3) ... [2018-07-24 01:19:21,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d3e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:19:21, skipping insertion in model container [2018-07-24 01:19:21,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:19:21" (3/3) ... [2018-07-24 01:19:21,500 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-07-24 01:19:21,510 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:19:21,520 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:19:21,568 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:19:21,569 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:19:21,569 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:19:21,569 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:19:21,569 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:19:21,570 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:19:21,570 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:19:21,570 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:19:21,570 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:19:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-24 01:19:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-24 01:19:21,614 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:21,615 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:21,615 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1302551623, now seen corresponding path program 1 times [2018-07-24 01:19:21,623 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:21,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:21,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:22,315 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-07-24 01:19:22,440 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:19:22,443 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:22,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:19:22,449 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:19:22,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:19:22,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:22,472 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-07-24 01:19:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:24,773 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-07-24 01:19:24,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:19:24,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-07-24 01:19:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:24,795 INFO L225 Difference]: With dead ends: 666 [2018-07-24 01:19:24,796 INFO L226 Difference]: Without dead ends: 460 [2018-07-24 01:19:24,800 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-07-24 01:19:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-07-24 01:19:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-07-24 01:19:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 736 transitions. [2018-07-24 01:19:24,876 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 736 transitions. Word has length 110 [2018-07-24 01:19:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:24,877 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 736 transitions. [2018-07-24 01:19:24,877 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:19:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 736 transitions. [2018-07-24 01:19:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-24 01:19:24,884 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:24,885 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:24,885 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:24,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1089256667, now seen corresponding path program 1 times [2018-07-24 01:19:24,886 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:24,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:24,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:19:25,296 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:25,296 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:19:25,298 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:19:25,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:19:25,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:25,299 INFO L87 Difference]: Start difference. First operand 460 states and 736 transitions. Second operand 4 states. [2018-07-24 01:19:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:27,054 INFO L93 Difference]: Finished difference Result 1710 states and 2816 transitions. [2018-07-24 01:19:27,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:19:27,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-07-24 01:19:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:27,066 INFO L225 Difference]: With dead ends: 1710 [2018-07-24 01:19:27,066 INFO L226 Difference]: Without dead ends: 1252 [2018-07-24 01:19:27,070 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-07-24 01:19:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-07-24 01:19:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-07-24 01:19:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1865 transitions. [2018-07-24 01:19:27,138 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1865 transitions. Word has length 118 [2018-07-24 01:19:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:27,139 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1865 transitions. [2018-07-24 01:19:27,139 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:19:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1865 transitions. [2018-07-24 01:19:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-24 01:19:27,147 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:27,147 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:27,147 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:27,148 INFO L82 PathProgramCache]: Analyzing trace with hash -498688923, now seen corresponding path program 1 times [2018-07-24 01:19:27,148 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:27,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:27,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:27,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:27,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-07-24 01:19:27,250 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:27,252 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:19:27,253 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:19:27,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:19:27,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:19:27,255 INFO L87 Difference]: Start difference. First operand 1252 states and 1865 transitions. Second operand 3 states. [2018-07-24 01:19:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:29,705 INFO L93 Difference]: Finished difference Result 2898 states and 4232 transitions. [2018-07-24 01:19:29,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:19:29,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-07-24 01:19:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:29,713 INFO L225 Difference]: With dead ends: 2898 [2018-07-24 01:19:29,714 INFO L226 Difference]: Without dead ends: 1508 [2018-07-24 01:19:29,716 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:19:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2018-07-24 01:19:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2018-07-24 01:19:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-07-24 01:19:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1989 transitions. [2018-07-24 01:19:29,752 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1989 transitions. Word has length 130 [2018-07-24 01:19:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:29,752 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 1989 transitions. [2018-07-24 01:19:29,752 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:19:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1989 transitions. [2018-07-24 01:19:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-24 01:19:29,756 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:29,757 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:29,757 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1049094016, now seen corresponding path program 1 times [2018-07-24 01:19:29,757 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:29,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:29,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:29,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:29,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:19:29,913 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:29,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:19:29,914 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:19:29,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:19:29,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:29,915 INFO L87 Difference]: Start difference. First operand 1508 states and 1989 transitions. Second operand 4 states. [2018-07-24 01:19:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:31,172 INFO L93 Difference]: Finished difference Result 4070 states and 5430 transitions. [2018-07-24 01:19:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:19:31,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-07-24 01:19:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:31,182 INFO L225 Difference]: With dead ends: 4070 [2018-07-24 01:19:31,182 INFO L226 Difference]: Without dead ends: 1612 [2018-07-24 01:19:31,186 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2018-07-24 01:19:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1612. [2018-07-24 01:19:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-07-24 01:19:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1877 transitions. [2018-07-24 01:19:31,218 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1877 transitions. Word has length 132 [2018-07-24 01:19:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:31,219 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 1877 transitions. [2018-07-24 01:19:31,219 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:19:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1877 transitions. [2018-07-24 01:19:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-24 01:19:31,222 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:31,223 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:31,223 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:31,223 INFO L82 PathProgramCache]: Analyzing trace with hash -208133908, now seen corresponding path program 1 times [2018-07-24 01:19:31,223 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:31,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:31,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:31,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:31,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-07-24 01:19:31,391 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:31,392 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:19:31,392 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:19:31,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:19:31,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:31,393 INFO L87 Difference]: Start difference. First operand 1612 states and 1877 transitions. Second operand 4 states. [2018-07-24 01:19:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:32,278 INFO L93 Difference]: Finished difference Result 3383 states and 3929 transitions. [2018-07-24 01:19:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:19:32,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-07-24 01:19:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:32,287 INFO L225 Difference]: With dead ends: 3383 [2018-07-24 01:19:32,288 INFO L226 Difference]: Without dead ends: 1773 [2018-07-24 01:19:32,290 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:19:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2018-07-24 01:19:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1744. [2018-07-24 01:19:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2018-07-24 01:19:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2012 transitions. [2018-07-24 01:19:32,324 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2012 transitions. Word has length 140 [2018-07-24 01:19:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:32,324 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2012 transitions. [2018-07-24 01:19:32,325 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:19:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2012 transitions. [2018-07-24 01:19:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-24 01:19:32,328 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:32,329 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 01:19:32,329 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:32,329 INFO L82 PathProgramCache]: Analyzing trace with hash -535301052, now seen corresponding path program 1 times [2018-07-24 01:19:32,329 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:32,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:32,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-07-24 01:19:32,522 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:32,522 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:19:32,523 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:19:32,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:19:32,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:19:32,524 INFO L87 Difference]: Start difference. First operand 1744 states and 2012 transitions. Second operand 5 states. [2018-07-24 01:19:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:33,801 INFO L93 Difference]: Finished difference Result 4674 states and 5439 transitions. [2018-07-24 01:19:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:19:33,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-07-24 01:19:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:33,820 INFO L225 Difference]: With dead ends: 4674 [2018-07-24 01:19:33,820 INFO L226 Difference]: Without dead ends: 2930 [2018-07-24 01:19:33,823 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:19:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2018-07-24 01:19:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2930. [2018-07-24 01:19:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2018-07-24 01:19:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 3285 transitions. [2018-07-24 01:19:33,880 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 3285 transitions. Word has length 145 [2018-07-24 01:19:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:33,880 INFO L471 AbstractCegarLoop]: Abstraction has 2930 states and 3285 transitions. [2018-07-24 01:19:33,881 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:19:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 3285 transitions. [2018-07-24 01:19:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-24 01:19:33,886 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:33,887 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:33,887 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -317751787, now seen corresponding path program 1 times [2018-07-24 01:19:33,888 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:33,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:33,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:33,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:33,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:34,392 WARN L169 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-07-24 01:19:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:19:34,430 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:34,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:19:34,431 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:19:34,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:19:34,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:19:34,432 INFO L87 Difference]: Start difference. First operand 2930 states and 3285 transitions. Second operand 5 states. [2018-07-24 01:19:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:38,082 INFO L93 Difference]: Finished difference Result 8636 states and 9772 transitions. [2018-07-24 01:19:38,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:19:38,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-07-24 01:19:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:38,102 INFO L225 Difference]: With dead ends: 8636 [2018-07-24 01:19:38,103 INFO L226 Difference]: Without dead ends: 5042 [2018-07-24 01:19:38,108 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:19:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5042 states. [2018-07-24 01:19:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5042 to 4247. [2018-07-24 01:19:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4247 states. [2018-07-24 01:19:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 4634 transitions. [2018-07-24 01:19:38,187 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 4634 transitions. Word has length 162 [2018-07-24 01:19:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:38,187 INFO L471 AbstractCegarLoop]: Abstraction has 4247 states and 4634 transitions. [2018-07-24 01:19:38,187 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:19:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 4634 transitions. [2018-07-24 01:19:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-24 01:19:38,199 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:38,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:38,200 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1644279675, now seen corresponding path program 1 times [2018-07-24 01:19:38,201 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:38,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:38,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:38,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:38,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:38,588 WARN L169 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-07-24 01:19:38,848 WARN L169 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-07-24 01:19:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 181 proven. 27 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-07-24 01:19:39,194 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:19:39,195 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:19:39,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:39,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:19:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-07-24 01:19:39,609 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:19:39,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-07-24 01:19:39,610 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 01:19:39,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 01:19:39,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:19:39,611 INFO L87 Difference]: Start difference. First operand 4247 states and 4634 transitions. Second operand 7 states. [2018-07-24 01:19:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:43,975 INFO L93 Difference]: Finished difference Result 7312 states and 7990 transitions. [2018-07-24 01:19:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 01:19:43,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2018-07-24 01:19:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:43,989 INFO L225 Difference]: With dead ends: 7312 [2018-07-24 01:19:43,989 INFO L226 Difference]: Without dead ends: 2667 [2018-07-24 01:19:43,994 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-07-24 01:19:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2018-07-24 01:19:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2387. [2018-07-24 01:19:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2387 states. [2018-07-24 01:19:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 2502 transitions. [2018-07-24 01:19:44,045 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 2502 transitions. Word has length 230 [2018-07-24 01:19:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:44,045 INFO L471 AbstractCegarLoop]: Abstraction has 2387 states and 2502 transitions. [2018-07-24 01:19:44,045 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 01:19:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 2502 transitions. [2018-07-24 01:19:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-07-24 01:19:44,053 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:44,053 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:44,053 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash 884619843, now seen corresponding path program 1 times [2018-07-24 01:19:44,054 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:44,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:44,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:44,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:44,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-07-24 01:19:44,549 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:44,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:19:44,550 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:19:44,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:19:44,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:44,551 INFO L87 Difference]: Start difference. First operand 2387 states and 2502 transitions. Second operand 4 states. [2018-07-24 01:19:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:45,203 INFO L93 Difference]: Finished difference Result 2387 states and 2502 transitions. [2018-07-24 01:19:45,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:19:45,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2018-07-24 01:19:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:45,207 INFO L225 Difference]: With dead ends: 2387 [2018-07-24 01:19:45,207 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 01:19:45,210 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:19:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 01:19:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 01:19:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 01:19:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 01:19:45,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-07-24 01:19:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:45,211 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 01:19:45,211 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:19:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 01:19:45,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 01:19:45,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 01:19:47,570 WARN L169 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-07-24 01:19:47,998 WARN L169 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-07-24 01:19:48,002 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-24 01:19:48,002 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-24 01:19:48,002 INFO L421 ceAbstractionStarter]: For program point L502'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,002 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-24 01:19:48,002 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-24 01:19:48,002 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-24 01:19:48,002 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 01:19:48,003 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-24 01:19:48,003 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-24 01:19:48,003 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 01:19:48,003 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-24 01:19:48,003 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-24 01:19:48,003 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,003 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,003 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-24 01:19:48,004 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-24 01:19:48,004 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,004 INFO L421 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,004 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,004 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-24 01:19:48,004 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,004 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-24 01:19:48,005 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,005 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-24 01:19:48,005 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-24 01:19:48,005 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,005 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-24 01:19:48,005 INFO L421 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,005 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-24 01:19:48,005 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,006 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,006 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-24 01:19:48,006 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,006 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,006 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-24 01:19:48,006 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,006 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-24 01:19:48,007 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,007 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-24 01:19:48,007 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,007 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-24 01:19:48,007 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,007 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-24 01:19:48,007 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,007 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-24 01:19:48,008 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-24 01:19:48,012 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-24 01:19:48,012 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,012 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-24 01:19:48,012 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,012 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-24 01:19:48,014 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-24 01:19:48,015 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,015 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-24 01:19:48,015 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,015 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-24 01:19:48,015 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,015 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,015 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-24 01:19:48,015 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,015 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-24 01:19:48,016 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,016 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-24 01:19:48,016 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-24 01:19:48,016 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-24 01:19:48,016 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-24 01:19:48,016 INFO L421 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,016 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-24 01:19:48,016 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,016 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-24 01:19:48,017 INFO L421 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,017 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-24 01:19:48,017 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-24 01:19:48,017 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-24 01:19:48,017 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,021 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-24 01:19:48,021 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,022 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-24 01:19:48,022 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-24 01:19:48,022 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-24 01:19:48,022 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,022 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-24 01:19:48,022 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 01:19:48,022 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,022 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-24 01:19:48,022 INFO L421 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,023 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-24 01:19:48,023 INFO L421 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,023 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,023 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-24 01:19:48,023 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,023 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-24 01:19:48,023 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-24 01:19:48,023 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,024 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-24 01:19:48,024 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-24 01:19:48,024 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,024 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,024 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-24 01:19:48,024 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-24 01:19:48,024 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-24 01:19:48,026 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,026 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-24 01:19:48,027 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-24 01:19:48,027 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-24 01:19:48,027 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,027 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-24 01:19:48,027 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,027 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-24 01:19:48,027 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-24 01:19:48,027 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-24 01:19:48,027 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,028 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-24 01:19:48,028 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-24 01:19:48,028 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-24 01:19:48,028 INFO L421 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,029 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 14))) (.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse0 (= ~__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__a17~0 0)) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 0)) (.cse8 (= ~__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 .cse0 .cse1) (and .cse2 .cse0 .cse3 .cse4) (and .cse5 .cse6 .cse4) (and .cse7 .cse6 (not .cse0) .cse4) (and .cse5 .cse1 .cse4 .cse8) (and .cse5 .cse2 .cse3 .cse4) (and .cse9 .cse5 .cse2 .cse4) (and .cse6 (not .cse8) .cse4) (and .cse7 .cse5 .cse1) (and .cse9 .cse1 .cse4) (and .cse6 .cse3 .cse4) (and .cse7 .cse1 .cse4) (and .cse7 .cse2 .cse0 .cse8 .cse4) (and .cse5 .cse2 .cse8 .cse4))) [2018-07-24 01:19:48,029 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-24 01:19:48,029 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,029 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-24 01:19:48,029 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-24 01:19:48,029 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-24 01:19:48,032 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,033 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-24 01:19:48,033 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-24 01:19:48,033 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-24 01:19:48,033 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-24 01:19:48,033 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-24 01:19:48,033 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-24 01:19:48,033 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,033 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-24 01:19:48,034 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-24 01:19:48,034 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,034 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-24 01:19:48,034 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-24 01:19:48,034 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-24 01:19:48,034 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,034 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-24 01:19:48,034 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-24 01:19:48,034 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-24 01:19:48,035 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-24 01:19:48,036 INFO L421 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,036 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-24 01:19:48,036 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-24 01:19:48,036 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-24 01:19:48,036 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-24 01:19:48,036 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-24 01:19:48,036 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-24 01:19:48,036 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-24 01:19:48,036 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-24 01:19:48,037 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-24 01:19:48,037 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-24 01:19:48,037 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-24 01:19:48,037 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-24 01:19:48,037 INFO L421 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,037 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-24 01:19:48,037 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-24 01:19:48,037 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-24 01:19:48,037 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-24 01:19:48,038 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-24 01:19:48,038 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,038 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-24 01:19:48,038 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,038 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 14))) (.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse0 (= ~__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__a17~0 0)) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 0)) (.cse8 (= ~__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 .cse0 .cse1) (and .cse2 .cse0 .cse3 .cse4) (and .cse5 .cse6 .cse4) (and .cse7 .cse6 (not .cse0) .cse4) (and .cse5 .cse1 .cse4 .cse8) (and .cse5 .cse2 .cse3 .cse4) (and .cse9 .cse5 .cse2 .cse4) (and .cse6 (not .cse8) .cse4) (and .cse7 .cse5 .cse1) (and .cse9 .cse1 .cse4) (and .cse6 .cse3 .cse4) (and .cse7 .cse1 .cse4) (and .cse7 .cse2 .cse0 .cse8 .cse4) (and .cse5 .cse2 .cse8 .cse4))) [2018-07-24 01:19:48,038 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-24 01:19:48,038 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-24 01:19:48,039 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-24 01:19:48,039 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-24 01:19:48,039 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-24 01:19:48,039 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-24 01:19:48,039 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,039 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-24 01:19:48,042 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-24 01:19:48,042 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-24 01:19:48,042 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:19:48,042 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-07-24 01:19:48,042 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 01:19:48,042 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-24 01:19:48,042 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-24 01:19:48,043 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-24 01:19:48,043 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-24 01:19:48,043 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-24 01:19:48,043 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-24 01:19:48,043 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-24 01:19:48,043 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-24 01:19:48,043 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-24 01:19:48,044 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-24 01:19:48,044 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-24 01:19:48,044 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-24 01:19:48,044 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-24 01:19:48,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:19:48 BoogieIcfgContainer [2018-07-24 01:19:48,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:19:48,091 INFO L168 Benchmark]: Toolchain (without parser) took 30732.13 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 888.5 MB. Max. memory is 7.1 GB. [2018-07-24 01:19:48,092 INFO L168 Benchmark]: CDTParser took 0.35 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:19:48,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.76 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-24 01:19:48,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.66 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:19:48,096 INFO L168 Benchmark]: Boogie Preprocessor took 209.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -869.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. [2018-07-24 01:19:48,097 INFO L168 Benchmark]: RCFGBuilder took 3109.21 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: 135.1 MB). Peak memory consumption was 135.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:19:48,100 INFO L168 Benchmark]: TraceAbstraction took 26593.99 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 341.3 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -410.8 MB). Peak memory consumption was 795.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:19:48,108 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.35 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 708.76 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.66 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 209.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -869.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3109.21 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: 135.1 MB). Peak memory consumption was 135.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26593.99 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 341.3 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -410.8 MB). Peak memory consumption was 795.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: 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__a17 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14)) && __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__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 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__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__a8 == 13) && __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 == 4)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14)) && __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__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __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__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 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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__a8 == 14)) && __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__a8 == 13) && __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 <= 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__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__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __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__a17 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14)) && __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__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 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__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__a8 == 13) && __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 == 4)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14)) && __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__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __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__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 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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__a8 == 14)) && __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__a8 == 13) && __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 <= 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__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__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __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, 26.4s OverallTime, 9 OverallIterations, 7 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 3148 SDslu, 417 SDs, 0 SdLazy, 6835 SolverSat, 1104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 242 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4247occurred in iteration=7, 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.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1104 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 80 NumberOfFragments, 335 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2245 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1704 NumberOfCodeBlocks, 1704 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1694 ConstructedInterpolants, 0 QuantifiedInterpolants, 712349 SizeOfPredicates, 1 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1191/1218 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_label11_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-19-48-131.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label11_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-19-48-131.csv Received shutdown request...