java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:50:50,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:50:50,082 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:50:50,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:50:50,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:50:50,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:50:50,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:50:50,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:50:50,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:50:50,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:50:50,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:50:50,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:50:50,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:50:50,103 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:50:50,105 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:50:50,105 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:50:50,106 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:50:50,108 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:50:50,110 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:50:50,112 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:50:50,113 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:50:50,114 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:50:50,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:50:50,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:50:50,117 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:50:50,118 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:50:50,119 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:50:50,120 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:50:50,120 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:50:50,121 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:50:50,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:50:50,122 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:50:50,123 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:50:50,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:50:50,124 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:50:50,124 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:50:50,125 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:50:50,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:50:50,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:50:50,141 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:50:50,141 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:50:50,142 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:50:50,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:50:50,142 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:50:50,143 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:50:50,143 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:50:50,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:50:50,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:50:50,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:50:50,144 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:50:50,144 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:50:50,144 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:50:50,144 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:50:50,144 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:50:50,145 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:50:50,145 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:50:50,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:50:50,145 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:50:50,145 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:50:50,146 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:50:50,146 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:50:50,146 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:50:50,146 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:50:50,146 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:50:50,147 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:50:50,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:50:50,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:50:50,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:50:50,208 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:50:50,209 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:50:50,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c [2018-10-24 14:50:50,271 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/375d996c1/82c72faa00814d02a1c21252f0a5a198/FLAG178fb7e8e [2018-10-24 14:50:50,900 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:50:50,905 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c [2018-10-24 14:50:50,919 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/375d996c1/82c72faa00814d02a1c21252f0a5a198/FLAG178fb7e8e [2018-10-24 14:50:50,935 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/375d996c1/82c72faa00814d02a1c21252f0a5a198 [2018-10-24 14:50:50,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:50:50,949 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:50:50,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:50,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:50:50,955 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:50:50,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:50" (1/1) ... [2018-10-24 14:50:50,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:50, skipping insertion in model container [2018-10-24 14:50:50,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:50" (1/1) ... [2018-10-24 14:50:50,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:50:51,051 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:50:51,547 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:51,556 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:50:51,694 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:51,716 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:50:51,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51 WrapperNode [2018-10-24 14:50:51,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:51,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:51,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:50:51,718 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:50:51,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... [2018-10-24 14:50:51,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... [2018-10-24 14:50:51,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:51,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:50:51,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:50:51,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:50:51,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... [2018-10-24 14:50:51,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... [2018-10-24 14:50:51,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... [2018-10-24 14:50:51,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... [2018-10-24 14:50:51,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... [2018-10-24 14:50:51,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... [2018-10-24 14:50:51,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... [2018-10-24 14:50:52,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:50:52,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:50:52,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:50:52,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:50:52,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:50:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:50:52,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:50:52,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:50:55,490 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:50:55,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:55 BoogieIcfgContainer [2018-10-24 14:50:55,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:50:55,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:50:55,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:50:55,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:50:55,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:50:50" (1/3) ... [2018-10-24 14:50:55,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e8ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:55, skipping insertion in model container [2018-10-24 14:50:55,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:51" (2/3) ... [2018-10-24 14:50:55,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e8ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:55, skipping insertion in model container [2018-10-24 14:50:55,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:55" (3/3) ... [2018-10-24 14:50:55,511 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label26_true-unreach-call_false-termination.c [2018-10-24 14:50:55,524 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:50:55,538 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:50:55,558 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:50:55,610 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:50:55,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:50:55,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:50:55,612 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:50:55,612 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:50:55,613 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:50:55,613 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:50:55,613 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:50:55,613 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:50:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:50:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-24 14:50:55,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:55,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:55,675 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:55,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:55,682 INFO L82 PathProgramCache]: Analyzing trace with hash 570499119, now seen corresponding path program 1 times [2018-10-24 14:50:55,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:55,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:55,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:56,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:56,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:56,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:56,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:56,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:56,461 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-10-24 14:50:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:58,713 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-10-24 14:50:58,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:58,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-10-24 14:50:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:58,736 INFO L225 Difference]: With dead ends: 666 [2018-10-24 14:50:58,736 INFO L226 Difference]: Without dead ends: 460 [2018-10-24 14:50:58,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-24 14:50:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-10-24 14:50:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-24 14:50:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 736 transitions. [2018-10-24 14:50:58,824 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 736 transitions. Word has length 104 [2018-10-24 14:50:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:58,825 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 736 transitions. [2018-10-24 14:50:58,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 736 transitions. [2018-10-24 14:50:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-24 14:50:58,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:58,831 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:58,831 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:58,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:58,832 INFO L82 PathProgramCache]: Analyzing trace with hash 498302915, now seen corresponding path program 1 times [2018-10-24 14:50:58,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:58,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:58,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:59,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:59,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:59,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:59,313 INFO L87 Difference]: Start difference. First operand 460 states and 736 transitions. Second operand 4 states. [2018-10-24 14:51:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:00,702 INFO L93 Difference]: Finished difference Result 1710 states and 2816 transitions. [2018-10-24 14:51:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:00,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-10-24 14:51:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:00,714 INFO L225 Difference]: With dead ends: 1710 [2018-10-24 14:51:00,714 INFO L226 Difference]: Without dead ends: 1252 [2018-10-24 14:51:00,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-10-24 14:51:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-10-24 14:51:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-24 14:51:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1792 transitions. [2018-10-24 14:51:00,792 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1792 transitions. Word has length 112 [2018-10-24 14:51:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:00,793 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1792 transitions. [2018-10-24 14:51:00,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1792 transitions. [2018-10-24 14:51:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-24 14:51:00,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:00,800 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:00,801 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:00,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:00,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1532168960, now seen corresponding path program 1 times [2018-10-24 14:51:00,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:00,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:00,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:00,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:00,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:01,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:01,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:01,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:01,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:01,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:01,134 INFO L87 Difference]: Start difference. First operand 1252 states and 1792 transitions. Second operand 4 states. [2018-10-24 14:51:04,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:04,714 INFO L93 Difference]: Finished difference Result 2502 states and 3582 transitions. [2018-10-24 14:51:04,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:04,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-10-24 14:51:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:04,720 INFO L225 Difference]: With dead ends: 2502 [2018-10-24 14:51:04,720 INFO L226 Difference]: Without dead ends: 1112 [2018-10-24 14:51:04,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2018-10-24 14:51:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2018-10-24 14:51:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-10-24 14:51:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1373 transitions. [2018-10-24 14:51:04,743 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1373 transitions. Word has length 126 [2018-10-24 14:51:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:04,744 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1373 transitions. [2018-10-24 14:51:04,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1373 transitions. [2018-10-24 14:51:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 14:51:04,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:04,747 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:04,748 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:04,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash 785761242, now seen corresponding path program 1 times [2018-10-24 14:51:04,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:04,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:04,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:04,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:04,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:04,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:04,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:04,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:04,875 INFO L87 Difference]: Start difference. First operand 1112 states and 1373 transitions. Second operand 3 states. [2018-10-24 14:51:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:05,955 INFO L93 Difference]: Finished difference Result 3278 states and 4062 transitions. [2018-10-24 14:51:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:05,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-10-24 14:51:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:05,966 INFO L225 Difference]: With dead ends: 3278 [2018-10-24 14:51:05,966 INFO L226 Difference]: Without dead ends: 2168 [2018-10-24 14:51:05,969 INFO L605 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-10-24 14:51:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-24 14:51:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2018-10-24 14:51:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2018-10-24 14:51:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2589 transitions. [2018-10-24 14:51:06,015 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2589 transitions. Word has length 127 [2018-10-24 14:51:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:06,016 INFO L481 AbstractCegarLoop]: Abstraction has 2168 states and 2589 transitions. [2018-10-24 14:51:06,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2589 transitions. [2018-10-24 14:51:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-24 14:51:06,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:06,021 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:06,021 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:06,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1198088578, now seen corresponding path program 1 times [2018-10-24 14:51:06,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:06,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:06,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:06,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:06,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 14:51:06,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:06,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:06,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:06,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:06,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:06,123 INFO L87 Difference]: Start difference. First operand 2168 states and 2589 transitions. Second operand 3 states. [2018-10-24 14:51:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:06,924 INFO L93 Difference]: Finished difference Result 6446 states and 7710 transitions. [2018-10-24 14:51:06,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:06,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-10-24 14:51:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:06,945 INFO L225 Difference]: With dead ends: 6446 [2018-10-24 14:51:06,946 INFO L226 Difference]: Without dead ends: 4280 [2018-10-24 14:51:06,950 INFO L605 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-10-24 14:51:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2018-10-24 14:51:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2018-10-24 14:51:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2018-10-24 14:51:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5015 transitions. [2018-10-24 14:51:07,037 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5015 transitions. Word has length 132 [2018-10-24 14:51:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:07,038 INFO L481 AbstractCegarLoop]: Abstraction has 4280 states and 5015 transitions. [2018-10-24 14:51:07,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5015 transitions. [2018-10-24 14:51:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-24 14:51:07,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:07,046 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:07,046 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:07,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:07,047 INFO L82 PathProgramCache]: Analyzing trace with hash 996846996, now seen corresponding path program 1 times [2018-10-24 14:51:07,047 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:07,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:07,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:07,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:07,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:51:07,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:07,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:07,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:07,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:07,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:07,170 INFO L87 Difference]: Start difference. First operand 4280 states and 5015 transitions. Second operand 3 states. [2018-10-24 14:51:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:08,342 INFO L93 Difference]: Finished difference Result 9218 states and 10823 transitions. [2018-10-24 14:51:08,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:08,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-10-24 14:51:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:08,362 INFO L225 Difference]: With dead ends: 9218 [2018-10-24 14:51:08,363 INFO L226 Difference]: Without dead ends: 4404 [2018-10-24 14:51:08,370 INFO L605 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-10-24 14:51:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2018-10-24 14:51:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 4404. [2018-10-24 14:51:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-10-24 14:51:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 5024 transitions. [2018-10-24 14:51:08,469 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 5024 transitions. Word has length 134 [2018-10-24 14:51:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:08,469 INFO L481 AbstractCegarLoop]: Abstraction has 4404 states and 5024 transitions. [2018-10-24 14:51:08,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 5024 transitions. [2018-10-24 14:51:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-24 14:51:08,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:08,476 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:08,476 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:08,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:08,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1333492588, now seen corresponding path program 1 times [2018-10-24 14:51:08,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:08,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:08,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:08,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:08,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:08,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:08,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:08,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:08,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:08,656 INFO L87 Difference]: Start difference. First operand 4404 states and 5024 transitions. Second operand 3 states. [2018-10-24 14:51:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:09,614 INFO L93 Difference]: Finished difference Result 8806 states and 10046 transitions. [2018-10-24 14:51:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:09,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-10-24 14:51:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:09,632 INFO L225 Difference]: With dead ends: 8806 [2018-10-24 14:51:09,633 INFO L226 Difference]: Without dead ends: 4404 [2018-10-24 14:51:09,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2018-10-24 14:51:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 4404. [2018-10-24 14:51:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-10-24 14:51:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 5000 transitions. [2018-10-24 14:51:09,725 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 5000 transitions. Word has length 134 [2018-10-24 14:51:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:09,726 INFO L481 AbstractCegarLoop]: Abstraction has 4404 states and 5000 transitions. [2018-10-24 14:51:09,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 5000 transitions. [2018-10-24 14:51:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-24 14:51:09,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:09,734 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:09,734 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:09,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1070772420, now seen corresponding path program 1 times [2018-10-24 14:51:09,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:09,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:09,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:10,256 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-24 14:51:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:10,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:10,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:51:10,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:51:10,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:51:10,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:51:10,351 INFO L87 Difference]: Start difference. First operand 4404 states and 5000 transitions. Second operand 7 states. [2018-10-24 14:51:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:15,064 INFO L93 Difference]: Finished difference Result 8878 states and 10070 transitions. [2018-10-24 14:51:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:51:15,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2018-10-24 14:51:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:15,088 INFO L225 Difference]: With dead ends: 8878 [2018-10-24 14:51:15,088 INFO L226 Difference]: Without dead ends: 4476 [2018-10-24 14:51:15,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:51:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2018-10-24 14:51:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 4404. [2018-10-24 14:51:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2018-10-24 14:51:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 4988 transitions. [2018-10-24 14:51:15,170 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 4988 transitions. Word has length 139 [2018-10-24 14:51:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:15,170 INFO L481 AbstractCegarLoop]: Abstraction has 4404 states and 4988 transitions. [2018-10-24 14:51:15,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:51:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 4988 transitions. [2018-10-24 14:51:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-24 14:51:15,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:15,177 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:15,177 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:15,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:15,178 INFO L82 PathProgramCache]: Analyzing trace with hash -473675391, now seen corresponding path program 1 times [2018-10-24 14:51:15,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:15,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:15,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:15,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:15,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:15,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:15,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:15,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:15,346 INFO L87 Difference]: Start difference. First operand 4404 states and 4988 transitions. Second operand 3 states. [2018-10-24 14:51:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:16,045 INFO L93 Difference]: Finished difference Result 11972 states and 13545 transitions. [2018-10-24 14:51:16,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:16,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-10-24 14:51:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:16,070 INFO L225 Difference]: With dead ends: 11972 [2018-10-24 14:51:16,071 INFO L226 Difference]: Without dead ends: 7570 [2018-10-24 14:51:16,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2018-10-24 14:51:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 7570. [2018-10-24 14:51:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7570 states. [2018-10-24 14:51:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 8453 transitions. [2018-10-24 14:51:16,186 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 8453 transitions. Word has length 164 [2018-10-24 14:51:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:16,187 INFO L481 AbstractCegarLoop]: Abstraction has 7570 states and 8453 transitions. [2018-10-24 14:51:16,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 8453 transitions. [2018-10-24 14:51:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 14:51:16,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:16,197 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:16,197 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:16,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:16,198 INFO L82 PathProgramCache]: Analyzing trace with hash -94169563, now seen corresponding path program 1 times [2018-10-24 14:51:16,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:16,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:16,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:16,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:16,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-24 14:51:16,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:16,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:16,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:16,357 INFO L87 Difference]: Start difference. First operand 7570 states and 8453 transitions. Second operand 3 states. [2018-10-24 14:51:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:17,563 INFO L93 Difference]: Finished difference Result 15006 states and 16766 transitions. [2018-10-24 14:51:17,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:17,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-24 14:51:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:17,574 INFO L225 Difference]: With dead ends: 15006 [2018-10-24 14:51:17,575 INFO L226 Difference]: Without dead ends: 5442 [2018-10-24 14:51:17,583 INFO L605 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-10-24 14:51:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2018-10-24 14:51:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 5442. [2018-10-24 14:51:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5442 states. [2018-10-24 14:51:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5442 states to 5442 states and 5900 transitions. [2018-10-24 14:51:17,649 INFO L78 Accepts]: Start accepts. Automaton has 5442 states and 5900 transitions. Word has length 172 [2018-10-24 14:51:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:17,649 INFO L481 AbstractCegarLoop]: Abstraction has 5442 states and 5900 transitions. [2018-10-24 14:51:17,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5442 states and 5900 transitions. [2018-10-24 14:51:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 14:51:17,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:17,657 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:17,657 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:17,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1926593862, now seen corresponding path program 1 times [2018-10-24 14:51:17,658 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:17,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:17,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-24 14:51:17,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:17,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:17,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:17,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:17,794 INFO L87 Difference]: Start difference. First operand 5442 states and 5900 transitions. Second operand 3 states. [2018-10-24 14:51:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:18,414 INFO L93 Difference]: Finished difference Result 10750 states and 11663 transitions. [2018-10-24 14:51:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:18,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-24 14:51:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:18,422 INFO L225 Difference]: With dead ends: 10750 [2018-10-24 14:51:18,422 INFO L226 Difference]: Without dead ends: 4378 [2018-10-24 14:51:18,428 INFO L605 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-10-24 14:51:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2018-10-24 14:51:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 3982. [2018-10-24 14:51:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3982 states. [2018-10-24 14:51:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 4304 transitions. [2018-10-24 14:51:18,479 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 4304 transitions. Word has length 202 [2018-10-24 14:51:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:18,479 INFO L481 AbstractCegarLoop]: Abstraction has 3982 states and 4304 transitions. [2018-10-24 14:51:18,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 4304 transitions. [2018-10-24 14:51:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-24 14:51:18,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:18,487 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:18,487 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:18,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1565053257, now seen corresponding path program 1 times [2018-10-24 14:51:18,487 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:18,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:18,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:18,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:18,870 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:51:19,144 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:51:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 220 proven. 27 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-24 14:51:19,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:51:19,522 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:51:19,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:19,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:51:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-10-24 14:51:19,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:51:19,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 14:51:19,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:51:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:51:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:51:19,953 INFO L87 Difference]: Start difference. First operand 3982 states and 4304 transitions. Second operand 8 states. [2018-10-24 14:51:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:24,491 INFO L93 Difference]: Finished difference Result 6778 states and 7358 transitions. [2018-10-24 14:51:24,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:51:24,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2018-10-24 14:51:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:24,492 INFO L225 Difference]: With dead ends: 6778 [2018-10-24 14:51:24,492 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:51:24,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:51:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:51:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:51:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:51:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:51:24,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2018-10-24 14:51:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:24,498 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:51:24,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:51:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:51:24,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:51:24,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:51:24,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:24,627 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 51 [2018-10-24 14:51:24,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:25,479 WARN L179 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-24 14:51:25,815 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,823 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,823 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,823 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:51:25,823 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:51:25,823 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:51:25,823 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:51:25,823 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:51:25,823 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:51:25,824 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:51:25,824 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:51:25,824 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:51:25,824 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a8~0 13)) (.cse8 (= ~a8~0 15))) (let ((.cse4 (not (= ~a7~0 1))) (.cse1 (= ~a20~0 1)) (.cse7 (= ~a17~0 1)) (.cse9 (not .cse8)) (.cse3 (= ~a16~0 5)) (.cse5 (= ~a16~0 4)) (.cse2 (= ~a21~0 1)) (.cse10 (not .cse0)) (.cse6 (<= ~a20~0 0))) (or (and .cse0 .cse1) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse6) (and .cse0 .cse7) (and .cse4 .cse8 .cse2 .cse6) (and .cse9 .cse2 .cse1) (and .cse4 .cse1 .cse2) (and .cse7 .cse9 .cse2) (and .cse2 .cse6 .cse3) (and .cse9 .cse10 .cse3) (and .cse5 .cse2 .cse10 .cse6)))) [2018-10-24 14:51:25,825 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,825 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,825 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,825 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,825 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,825 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:51:25,825 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:51:25,825 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:51:25,826 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:51:25,826 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:51:25,826 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:51:25,826 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:51:25,826 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:51:25,826 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:51:25,826 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:51:25,826 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:51:25,826 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:51:25,827 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:51:25,827 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:51:25,827 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,827 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,827 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,827 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,827 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,827 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:51:25,828 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:51:25,828 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:51:25,828 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:51:25,828 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:51:25,828 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:51:25,828 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:51:25,828 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:51:25,828 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:51:25,829 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,829 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,829 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,829 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,829 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,829 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:51:25,829 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:51:25,829 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:51:25,829 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:51:25,830 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:51:25,830 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:51:25,830 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:51:25,830 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:51:25,830 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:51:25,830 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:51:25,830 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:51:25,830 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:51:25,830 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:51:25,831 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:51:25,831 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:51:25,831 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:51:25,831 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,831 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,831 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a8~0 13)) (.cse8 (= ~a8~0 15))) (let ((.cse4 (not (= ~a7~0 1))) (.cse1 (= ~a20~0 1)) (.cse7 (= ~a17~0 1)) (.cse9 (not .cse8)) (.cse3 (= ~a16~0 5)) (.cse5 (= ~a16~0 4)) (.cse2 (= ~a21~0 1)) (.cse10 (not .cse0)) (.cse6 (<= ~a20~0 0))) (or (and .cse0 .cse1) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse6) (and .cse0 .cse7) (and .cse4 .cse8 .cse2 .cse6) (and .cse9 .cse2 .cse1) (and .cse4 .cse1 .cse2) (and .cse7 .cse9 .cse2) (and .cse2 .cse6 .cse3) (and .cse9 .cse10 .cse3) (and .cse5 .cse2 .cse10 .cse6)))) [2018-10-24 14:51:25,831 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:51:25,832 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:51:25,833 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,833 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,833 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,833 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,833 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,833 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:51:25,833 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:51:25,833 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:51:25,833 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:51:25,834 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,835 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,835 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,835 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,835 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,835 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:51:25,835 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,835 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:51:25,835 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:51:25,836 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:51:25,836 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:51:25,836 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:51:25,836 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:51:25,836 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:51:25,836 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:51:25,836 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:51:25,836 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:51:25,837 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:51:25,837 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:51:25,837 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:51:25,837 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,837 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,837 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,837 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,837 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,837 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,838 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:51:25,838 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:51:25,838 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:51:25,838 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:51:25,838 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:51:25,838 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:51:25,838 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:51:25,838 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:51:25,838 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,839 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:51:25,840 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:51:25,841 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:51:25,841 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:51:25,841 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:51:25,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:51:25 BoogieIcfgContainer [2018-10-24 14:51:25,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:51:25,879 INFO L168 Benchmark]: Toolchain (without parser) took 34931.89 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -669.9 MB). Peak memory consumption was 361.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,881 INFO L168 Benchmark]: CDTParser took 0.22 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-10-24 14:51:25,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 205.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 680.5 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -758.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,886 INFO L168 Benchmark]: Boogie Preprocessor took 79.56 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:51:25,887 INFO L168 Benchmark]: RCFGBuilder took 3490.91 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.8 MB). Peak memory consumption was 121.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,893 INFO L168 Benchmark]: TraceAbstraction took 30381.72 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 351.3 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -64.9 MB). Peak memory consumption was 286.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,899 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 205.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 680.5 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -758.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.56 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3490.91 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 121.8 MB). Peak memory consumption was 121.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30381.72 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 351.3 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -64.9 MB). Peak memory consumption was 286.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((a8 == 13 && a20 == 1) || ((a8 == 13 && a21 == 1) && a16 == 5)) || (((!(a7 == 1) && a16 == 4) && a21 == 1) && a20 <= 0)) || (a8 == 13 && a17 == 1)) || (((!(a7 == 1) && a8 == 15) && a21 == 1) && a20 <= 0)) || ((!(a8 == 15) && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && a20 == 1) && a21 == 1)) || ((a17 == 1 && !(a8 == 15)) && a21 == 1)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((!(a8 == 15) && !(a8 == 13)) && a16 == 5)) || (((a16 == 4 && a21 == 1) && !(a8 == 13)) && a20 <= 0) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((a8 == 13 && a20 == 1) || ((a8 == 13 && a21 == 1) && a16 == 5)) || (((!(a7 == 1) && a16 == 4) && a21 == 1) && a20 <= 0)) || (a8 == 13 && a17 == 1)) || (((!(a7 == 1) && a8 == 15) && a21 == 1) && a20 <= 0)) || ((!(a8 == 15) && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && a20 == 1) && a21 == 1)) || ((a17 == 1 && !(a8 == 15)) && a21 == 1)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((!(a8 == 15) && !(a8 == 13)) && a16 == 5)) || (((a16 == 4 && a21 == 1) && !(a8 == 13)) && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 30.2s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1517 SDtfs, 3307 SDslu, 607 SDs, 0 SdLazy, 7751 SolverSat, 1355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 248 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7570occurred in iteration=9, 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, 12 MinimizatonAttempts, 468 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 116 NumberOfFragments, 245 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3622 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 196 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2010 NumberOfCodeBlocks, 2010 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1997 ConstructedInterpolants, 0 QuantifiedInterpolants, 739547 SizeOfPredicates, 1 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1188/1215 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...