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_label59_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:21:18,553 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:21:18,555 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:21:18,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:21:18,569 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:21:18,570 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:21:18,571 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:21:18,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:21:18,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:21:18,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:21:18,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:21:18,577 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:21:18,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:21:18,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:21:18,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:21:18,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:21:18,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:21:18,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:21:18,586 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:21:18,587 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:21:18,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:21:18,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:21:18,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:21:18,594 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:21:18,594 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:21:18,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:21:18,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:21:18,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:21:18,597 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:21:18,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:21:18,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:21:18,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:21:18,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:21:18,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:21:18,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:21:18,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:21:18,602 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 01:21:18,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:21:18,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:21:18,627 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:21:18,627 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:21:18,631 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:21:18,631 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:21:18,631 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:21:18,632 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:21:18,632 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:21:18,632 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:21:18,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:21:18,633 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:21:18,633 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:21:18,634 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:21:18,634 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:21:18,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:21:18,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:21:18,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:21:18,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:21:18,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:21:18,635 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:21:18,635 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:21:18,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:21:18,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:21:18,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:21:18,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:21:18,637 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:21:18,637 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:21:18,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:21:18,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:21:18,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:21:18,727 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:21:18,728 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:21:18,729 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label59_true-unreach-call_false-termination.c [2018-07-24 01:21:19,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba60a370/adfd2b0da8654b6e913c9fac0b7c75aa/FLAGc3b1adaa5 [2018-07-24 01:21:19,426 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:21:19,429 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label59_true-unreach-call_false-termination.c [2018-07-24 01:21:19,461 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba60a370/adfd2b0da8654b6e913c9fac0b7c75aa/FLAGc3b1adaa5 [2018-07-24 01:21:19,478 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba60a370/adfd2b0da8654b6e913c9fac0b7c75aa [2018-07-24 01:21:19,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:21:19,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:21:19,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:21:19,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:21:19,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:21:19,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:21:19" (1/1) ... [2018-07-24 01:21:19,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f57add1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:19, skipping insertion in model container [2018-07-24 01:21:19,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:21:19" (1/1) ... [2018-07-24 01:21:19,715 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:21:19,993 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:21:20,011 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:21:20,169 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:21:20,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20 WrapperNode [2018-07-24 01:21:20,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:21:20,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:21:20,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:21:20,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:21:20,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:21:20,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:21:20,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:21:20,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:21:20,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... [2018-07-24 01:21:20,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:21:20,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:21:20,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:21:20,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:21:20,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:21:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:21:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:21:20,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:21:23,838 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:21:23,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:21:23 BoogieIcfgContainer [2018-07-24 01:21:23,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:21:23,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:21:23,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:21:23,844 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:21:23,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:21:19" (1/3) ... [2018-07-24 01:21:23,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46670385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:21:23, skipping insertion in model container [2018-07-24 01:21:23,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:21:20" (2/3) ... [2018-07-24 01:21:23,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46670385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:21:23, skipping insertion in model container [2018-07-24 01:21:23,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:21:23" (3/3) ... [2018-07-24 01:21:23,851 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label59_true-unreach-call_false-termination.c [2018-07-24 01:21:23,867 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:21:23,884 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:21:23,940 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:21:23,941 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:21:23,942 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:21:23,942 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:21:23,942 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:21:23,942 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:21:23,943 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:21:23,943 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:21:23,943 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:21:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-24 01:21:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-24 01:21:23,980 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:23,981 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] [2018-07-24 01:21:23,982 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1373899785, now seen corresponding path program 1 times [2018-07-24 01:21:23,990 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:23,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:24,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:24,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:24,682 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:24,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:24,691 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:24,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:24,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:24,710 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-07-24 01:21:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:27,053 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-07-24 01:21:27,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:27,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-07-24 01:21:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:27,077 INFO L225 Difference]: With dead ends: 666 [2018-07-24 01:21:27,077 INFO L226 Difference]: Without dead ends: 460 [2018-07-24 01:21:27,082 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-07-24 01:21:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-07-24 01:21:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-07-24 01:21:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 736 transitions. [2018-07-24 01:21:27,163 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 736 transitions. Word has length 90 [2018-07-24 01:21:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:27,164 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 736 transitions. [2018-07-24 01:21:27,164 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 736 transitions. [2018-07-24 01:21:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-24 01:21:27,170 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:27,170 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] [2018-07-24 01:21:27,170 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1336174219, now seen corresponding path program 1 times [2018-07-24 01:21:27,171 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:27,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:27,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:27,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:27,459 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:21:27,460 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:27,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:27,462 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:27,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:27,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:27,463 INFO L87 Difference]: Start difference. First operand 460 states and 736 transitions. Second operand 4 states. [2018-07-24 01:21:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:28,999 INFO L93 Difference]: Finished difference Result 1710 states and 2816 transitions. [2018-07-24 01:21:29,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:29,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-07-24 01:21:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:29,010 INFO L225 Difference]: With dead ends: 1710 [2018-07-24 01:21:29,010 INFO L226 Difference]: Without dead ends: 1252 [2018-07-24 01:21:29,014 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-07-24 01:21:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-07-24 01:21:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-07-24 01:21:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1792 transitions. [2018-07-24 01:21:29,089 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1792 transitions. Word has length 98 [2018-07-24 01:21:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:29,090 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1792 transitions. [2018-07-24 01:21:29,090 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1792 transitions. [2018-07-24 01:21:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-24 01:21:29,107 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:29,107 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:29,108 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash -335865208, now seen corresponding path program 1 times [2018-07-24 01:21:29,108 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:29,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:29,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:29,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:29,255 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:29,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:21:29,256 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:29,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:29,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:29,257 INFO L87 Difference]: Start difference. First operand 1252 states and 1792 transitions. Second operand 4 states. [2018-07-24 01:21:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:32,098 INFO L93 Difference]: Finished difference Result 4904 states and 7065 transitions. [2018-07-24 01:21:32,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:32,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-07-24 01:21:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:32,114 INFO L225 Difference]: With dead ends: 4904 [2018-07-24 01:21:32,114 INFO L226 Difference]: Without dead ends: 3110 [2018-07-24 01:21:32,117 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2018-07-24 01:21:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2168. [2018-07-24 01:21:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2018-07-24 01:21:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2832 transitions. [2018-07-24 01:21:32,168 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2832 transitions. Word has length 112 [2018-07-24 01:21:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:32,169 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 2832 transitions. [2018-07-24 01:21:32,169 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2832 transitions. [2018-07-24 01:21:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-24 01:21:32,172 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:32,173 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:32,173 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:32,173 INFO L82 PathProgramCache]: Analyzing trace with hash -86274334, now seen corresponding path program 1 times [2018-07-24 01:21:32,173 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:32,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:32,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:32,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:32,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:32,267 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:32,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:21:32,268 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:21:32,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:21:32,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:32,269 INFO L87 Difference]: Start difference. First operand 2168 states and 2832 transitions. Second operand 3 states. [2018-07-24 01:21:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:33,049 INFO L93 Difference]: Finished difference Result 6446 states and 8439 transitions. [2018-07-24 01:21:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:33,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-07-24 01:21:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:33,070 INFO L225 Difference]: With dead ends: 6446 [2018-07-24 01:21:33,070 INFO L226 Difference]: Without dead ends: 4280 [2018-07-24 01:21:33,074 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2018-07-24 01:21:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2018-07-24 01:21:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2018-07-24 01:21:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5369 transitions. [2018-07-24 01:21:33,151 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5369 transitions. Word has length 113 [2018-07-24 01:21:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:33,151 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5369 transitions. [2018-07-24 01:21:33,151 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:21:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5369 transitions. [2018-07-24 01:21:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-24 01:21:33,157 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:33,157 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:33,157 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:33,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1842695542, now seen corresponding path program 1 times [2018-07-24 01:21:33,158 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:33,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:33,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 01:21:33,255 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:33,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:21:33,256 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:21:33,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:21:33,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:33,256 INFO L87 Difference]: Start difference. First operand 4280 states and 5369 transitions. Second operand 3 states. [2018-07-24 01:21:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:34,409 INFO L93 Difference]: Finished difference Result 12518 states and 15731 transitions. [2018-07-24 01:21:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:34,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-07-24 01:21:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:34,440 INFO L225 Difference]: With dead ends: 12518 [2018-07-24 01:21:34,440 INFO L226 Difference]: Without dead ends: 8240 [2018-07-24 01:21:34,447 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8240 states. [2018-07-24 01:21:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8240 to 8108. [2018-07-24 01:21:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8108 states. [2018-07-24 01:21:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8108 states to 8108 states and 9962 transitions. [2018-07-24 01:21:34,571 INFO L78 Accepts]: Start accepts. Automaton has 8108 states and 9962 transitions. Word has length 118 [2018-07-24 01:21:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:34,571 INFO L471 AbstractCegarLoop]: Abstraction has 8108 states and 9962 transitions. [2018-07-24 01:21:34,571 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:21:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8108 states and 9962 transitions. [2018-07-24 01:21:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-24 01:21:34,577 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:34,578 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:34,578 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:34,578 INFO L82 PathProgramCache]: Analyzing trace with hash 846112284, now seen corresponding path program 1 times [2018-07-24 01:21:34,578 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:34,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:21:34,674 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:34,675 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:21:34,675 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:21:34,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:21:34,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:34,676 INFO L87 Difference]: Start difference. First operand 8108 states and 9962 transitions. Second operand 3 states. [2018-07-24 01:21:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:35,717 INFO L93 Difference]: Finished difference Result 16874 states and 20717 transitions. [2018-07-24 01:21:35,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:35,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-07-24 01:21:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:35,742 INFO L225 Difference]: With dead ends: 16874 [2018-07-24 01:21:35,742 INFO L226 Difference]: Without dead ends: 7704 [2018-07-24 01:21:35,752 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7704 states. [2018-07-24 01:21:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7704 to 7704. [2018-07-24 01:21:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7704 states. [2018-07-24 01:21:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 8910 transitions. [2018-07-24 01:21:35,868 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 8910 transitions. Word has length 120 [2018-07-24 01:21:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:35,868 INFO L471 AbstractCegarLoop]: Abstraction has 7704 states and 8910 transitions. [2018-07-24 01:21:35,868 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:21:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 8910 transitions. [2018-07-24 01:21:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-24 01:21:35,874 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:35,875 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:35,875 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash -606204428, now seen corresponding path program 1 times [2018-07-24 01:21:35,875 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:35,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:35,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:35,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:36,049 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:36,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:21:36,050 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:21:36,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:21:36,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:36,051 INFO L87 Difference]: Start difference. First operand 7704 states and 8910 transitions. Second operand 3 states. [2018-07-24 01:21:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:36,973 INFO L93 Difference]: Finished difference Result 15538 states and 17962 transitions. [2018-07-24 01:21:36,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:36,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-07-24 01:21:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:37,000 INFO L225 Difference]: With dead ends: 15538 [2018-07-24 01:21:37,000 INFO L226 Difference]: Without dead ends: 7836 [2018-07-24 01:21:37,006 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2018-07-24 01:21:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 7836. [2018-07-24 01:21:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7836 states. [2018-07-24 01:21:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7836 states to 7836 states and 9024 transitions. [2018-07-24 01:21:37,111 INFO L78 Accepts]: Start accepts. Automaton has 7836 states and 9024 transitions. Word has length 120 [2018-07-24 01:21:37,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:37,111 INFO L471 AbstractCegarLoop]: Abstraction has 7836 states and 9024 transitions. [2018-07-24 01:21:37,112 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:21:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7836 states and 9024 transitions. [2018-07-24 01:21:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-24 01:21:37,117 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:37,118 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:37,118 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash 848756044, now seen corresponding path program 1 times [2018-07-24 01:21:37,119 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:37,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:37,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:37,365 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:37,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-24 01:21:37,366 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 01:21:37,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 01:21:37,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-24 01:21:37,366 INFO L87 Difference]: Start difference. First operand 7836 states and 9024 transitions. Second operand 8 states. [2018-07-24 01:21:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:42,352 INFO L93 Difference]: Finished difference Result 15960 states and 18347 transitions. [2018-07-24 01:21:42,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 01:21:42,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-07-24 01:21:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:42,367 INFO L225 Difference]: With dead ends: 15960 [2018-07-24 01:21:42,367 INFO L226 Difference]: Without dead ends: 8258 [2018-07-24 01:21:42,375 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-24 01:21:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2018-07-24 01:21:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 7836. [2018-07-24 01:21:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7836 states. [2018-07-24 01:21:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7836 states to 7836 states and 9006 transitions. [2018-07-24 01:21:42,480 INFO L78 Accepts]: Start accepts. Automaton has 7836 states and 9006 transitions. Word has length 125 [2018-07-24 01:21:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:42,480 INFO L471 AbstractCegarLoop]: Abstraction has 7836 states and 9006 transitions. [2018-07-24 01:21:42,480 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 01:21:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7836 states and 9006 transitions. [2018-07-24 01:21:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-24 01:21:42,487 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:42,487 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-07-24 01:21:42,488 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1036256058, now seen corresponding path program 1 times [2018-07-24 01:21:42,488 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:42,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:42,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-07-24 01:21:42,650 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:42,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:42,650 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:21:42,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:21:42,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:21:42,651 INFO L87 Difference]: Start difference. First operand 7836 states and 9006 transitions. Second operand 5 states. [2018-07-24 01:21:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:44,681 INFO L93 Difference]: Finished difference Result 15538 states and 17872 transitions. [2018-07-24 01:21:44,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:21:44,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-07-24 01:21:44,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:44,689 INFO L225 Difference]: With dead ends: 15538 [2018-07-24 01:21:44,689 INFO L226 Difference]: Without dead ends: 3580 [2018-07-24 01:21:44,698 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:21:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2018-07-24 01:21:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3316. [2018-07-24 01:21:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2018-07-24 01:21:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 3638 transitions. [2018-07-24 01:21:44,743 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 3638 transitions. Word has length 150 [2018-07-24 01:21:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:44,744 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 3638 transitions. [2018-07-24 01:21:44,744 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:21:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 3638 transitions. [2018-07-24 01:21:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-24 01:21:44,748 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:44,748 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:44,748 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash 744617161, now seen corresponding path program 1 times [2018-07-24 01:21:44,749 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:44,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:44,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:44,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:44,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:45,048 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-07-24 01:21:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:21:45,076 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:45,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:45,077 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:45,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:45,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:45,079 INFO L87 Difference]: Start difference. First operand 3316 states and 3638 transitions. Second operand 4 states. [2018-07-24 01:21:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:46,121 INFO L93 Difference]: Finished difference Result 5832 states and 6423 transitions. [2018-07-24 01:21:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:46,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-07-24 01:21:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:46,127 INFO L225 Difference]: With dead ends: 5832 [2018-07-24 01:21:46,127 INFO L226 Difference]: Without dead ends: 2650 [2018-07-24 01:21:46,130 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:21:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2018-07-24 01:21:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2018-07-24 01:21:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2018-07-24 01:21:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 2833 transitions. [2018-07-24 01:21:46,173 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 2833 transitions. Word has length 150 [2018-07-24 01:21:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:46,174 INFO L471 AbstractCegarLoop]: Abstraction has 2650 states and 2833 transitions. [2018-07-24 01:21:46,174 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 2833 transitions. [2018-07-24 01:21:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-24 01:21:46,179 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:46,179 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:46,180 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:46,180 INFO L82 PathProgramCache]: Analyzing trace with hash -529483922, now seen corresponding path program 1 times [2018-07-24 01:21:46,180 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:46,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:46,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-07-24 01:21:46,494 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:46,495 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:46,495 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:46,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:46,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:46,496 INFO L87 Difference]: Start difference. First operand 2650 states and 2833 transitions. Second operand 4 states. [2018-07-24 01:21:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:47,247 INFO L93 Difference]: Finished difference Result 4765 states and 5108 transitions. [2018-07-24 01:21:47,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:47,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-07-24 01:21:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:47,250 INFO L225 Difference]: With dead ends: 4765 [2018-07-24 01:21:47,250 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 01:21:47,253 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:21:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 01:21:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 01:21:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 01:21:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 01:21:47,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2018-07-24 01:21:47,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:47,255 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 01:21:47,255 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 01:21:47,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 01:21:47,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 01:21:47,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:47,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:47,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:47,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:21:48,111 WARN L169 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2018-07-24 01:21:48,400 WARN L169 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2018-07-24 01:21:48,403 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,404 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-24 01:21:48,405 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,406 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-24 01:21:48,406 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-24 01:21:48,406 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,406 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-24 01:21:48,406 INFO L421 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,406 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-24 01:21:48,406 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,406 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,407 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-24 01:21:48,407 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,407 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,407 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-24 01:21:48,407 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,407 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-24 01:21:48,407 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,407 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-24 01:21:48,407 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,408 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-24 01:21:48,408 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,408 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-24 01:21:48,408 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,408 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-24 01:21:48,408 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-24 01:21:48,408 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-24 01:21:48,408 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,408 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-24 01:21:48,409 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,409 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-24 01:21:48,409 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-24 01:21:48,409 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,409 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-24 01:21:48,409 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,409 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-24 01:21:48,409 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-24 01:21:48,410 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,411 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-24 01:21:48,412 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,413 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-24 01:21:48,414 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-24 01:21:48,414 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-24 01:21:48,414 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,414 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-24 01:21:48,414 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-24 01:21:48,414 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-24 01:21:48,414 INFO L421 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,415 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15))) (.cse4 (or (and .cse6 .cse7) (and .cse5 .cse7))) (.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse8 (= ~__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 .cse2) (and .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse0 .cse8) (and .cse1 .cse5 .cse3 .cse8) (and .cse1 .cse6 .cse9 .cse8) (and .cse4 .cse9) (and .cse3 .cse9 .cse8) (and (and (and .cse1 .cse2) .cse5) .cse6 .cse8)))) [2018-07-24 01:21:48,415 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-24 01:21:48,415 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,415 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-24 01:21:48,415 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-24 01:21:48,415 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-24 01:21:48,416 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,416 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-24 01:21:48,416 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-24 01:21:48,416 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-24 01:21:48,416 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-24 01:21:48,416 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-24 01:21:48,416 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-24 01:21:48,416 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-24 01:21:48,417 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-24 01:21:48,418 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-24 01:21:48,419 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15))) (.cse4 (or (and .cse6 .cse7) (and .cse5 .cse7))) (.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse8 (= ~__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 .cse2) (and .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse0 .cse8) (and .cse1 .cse5 .cse3 .cse8) (and .cse1 .cse6 .cse9 .cse8) (and .cse4 .cse9) (and .cse3 .cse9 .cse8) (and (and (and .cse1 .cse2) .cse5) .cse6 .cse8)))) [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,420 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 443) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L442'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-24 01:21:48,421 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-24 01:21:48,422 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-24 01:21:48,422 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-24 01:21:48,422 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-24 01:21:48,422 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-24 01:21:48,422 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-24 01:21:48,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:21:48 BoogieIcfgContainer [2018-07-24 01:21:48,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:21:48,446 INFO L168 Benchmark]: Toolchain (without parser) took 28956.25 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 86.5 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:48,447 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:21:48,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:48,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:48,449 INFO L168 Benchmark]: Boogie Preprocessor took 240.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.8 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:48,450 INFO L168 Benchmark]: RCFGBuilder took 3272.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 122.8 MB). Peak memory consumption was 122.8 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:48,451 INFO L168 Benchmark]: TraceAbstraction took 24604.72 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 341.3 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -338.7 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:48,456 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 718.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 114.49 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 240.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.8 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3272.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 122.8 MB). Peak memory consumption was 122.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24604.72 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 341.3 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -338.7 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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__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__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__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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__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__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__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 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__a8 == 13) || (__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__a20 <= 0)) || ((__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__a20 <= 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 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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__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__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__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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__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__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__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 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__a8 == 13) || (__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__a20 <= 0)) || ((__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__a20 <= 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 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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, 24.4s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 19.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1566 SDtfs, 2872 SDslu, 613 SDs, 0 SdLazy, 6863 SolverSat, 1300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8108occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1760 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 128 NumberOfFragments, 253 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4180 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 376 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1360 NumberOfCodeBlocks, 1360 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1349 ConstructedInterpolants, 0 QuantifiedInterpolants, 403912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 472/472 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_label59_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-21-48-476.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label59_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-21-48-476.csv Received shutdown request...