java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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/Problem02_label00_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:50:43,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:50:43,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:50:43,108 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:50:43,108 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:50:43,110 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:50:43,111 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:50:43,113 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:50:43,116 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:50:43,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:50:43,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:50:43,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:50:43,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:50:43,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:50:43,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:50:43,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:50:43,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:50:43,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:50:43,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:50:43,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:50:43,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:50:43,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:50:43,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:50:43,136 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:50:43,136 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:50:43,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:50:43,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:50:43,139 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:50:43,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:50:43,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:50:43,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:50:43,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:50:43,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:50:43,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:50:43,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:50:43,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:50:43,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:50:43,159 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:50:43,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:50:43,161 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:50:43,161 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:50:43,162 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:50:43,162 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:50:43,162 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:50:43,162 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:50:43,162 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:50:43,163 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:50:43,163 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:50:43,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:50:43,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:50:43,163 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:50:43,163 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:50:43,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:50:43,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:50:43,164 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:50:43,164 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:50:43,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:50:43,165 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:50:43,165 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:50:43,165 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:50:43,165 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:50:43,165 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:50:43,166 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:50:43,166 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:50:43,166 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:50:43,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:50:43,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:50:43,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:50:43,236 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:50:43,237 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:50:43,237 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-11-06 19:50:43,300 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bad58484/bb68d24ae6904bed87c00b4f52bdd2b7/FLAG3eab734ef [2018-11-06 19:50:43,853 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:50:43,854 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-11-06 19:50:43,874 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bad58484/bb68d24ae6904bed87c00b4f52bdd2b7/FLAG3eab734ef [2018-11-06 19:50:43,904 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bad58484/bb68d24ae6904bed87c00b4f52bdd2b7 [2018-11-06 19:50:43,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:50:43,919 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:50:43,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:50:43,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:50:43,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:50:43,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:43" (1/1) ... [2018-11-06 19:50:43,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e912aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:43, skipping insertion in model container [2018-11-06 19:50:43,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:43" (1/1) ... [2018-11-06 19:50:43,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:50:43,997 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:50:44,434 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:50:44,441 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:50:44,570 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:50:44,596 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:50:44,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44 WrapperNode [2018-11-06 19:50:44,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:50:44,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:50:44,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:50:44,598 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:50:44,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... [2018-11-06 19:50:44,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... [2018-11-06 19:50:44,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:50:44,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:50:44,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:50:44,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:50:44,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... [2018-11-06 19:50:44,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... [2018-11-06 19:50:44,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... [2018-11-06 19:50:44,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... [2018-11-06 19:50:44,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... [2018-11-06 19:50:44,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... [2018-11-06 19:50:44,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... [2018-11-06 19:50:44,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:50:44,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:50:44,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:50:44,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:50:44,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:50:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:50:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:50:44,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:50:48,238 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:50:48,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:48 BoogieIcfgContainer [2018-11-06 19:50:48,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:50:48,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:50:48,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:50:48,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:50:48,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:50:43" (1/3) ... [2018-11-06 19:50:48,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453f243e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:48, skipping insertion in model container [2018-11-06 19:50:48,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:44" (2/3) ... [2018-11-06 19:50:48,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453f243e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:48, skipping insertion in model container [2018-11-06 19:50:48,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:48" (3/3) ... [2018-11-06 19:50:48,248 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label00_true-unreach-call_false-termination.c [2018-11-06 19:50:48,259 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:50:48,269 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:50:48,288 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:50:48,326 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:50:48,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:50:48,328 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:50:48,328 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:50:48,328 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:50:48,328 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:50:48,329 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:50:48,329 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:50:48,329 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:50:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2018-11-06 19:50:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-06 19:50:48,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:48,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:48,377 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:48,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:48,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1654512108, now seen corresponding path program 1 times [2018-11-06 19:50:48,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:48,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:48,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:48,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:48,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:49,011 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:50:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:49,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:49,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:49,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:49,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:49,086 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 4 states. [2018-11-06 19:50:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:51,823 INFO L93 Difference]: Finished difference Result 779 states and 1357 transitions. [2018-11-06 19:50:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:51,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-11-06 19:50:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:51,850 INFO L225 Difference]: With dead ends: 779 [2018-11-06 19:50:51,850 INFO L226 Difference]: Without dead ends: 544 [2018-11-06 19:50:51,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-11-06 19:50:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 370. [2018-11-06 19:50:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-06 19:50:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 594 transitions. [2018-11-06 19:50:51,937 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 594 transitions. Word has length 116 [2018-11-06 19:50:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:51,939 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 594 transitions. [2018-11-06 19:50:51,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 594 transitions. [2018-11-06 19:50:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-06 19:50:51,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:51,954 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:51,954 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:51,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash -220215521, now seen corresponding path program 1 times [2018-11-06 19:50:51,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:51,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:51,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:52,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:52,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:52,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:52,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:52,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:52,180 INFO L87 Difference]: Start difference. First operand 370 states and 594 transitions. Second operand 3 states. [2018-11-06 19:50:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:53,455 INFO L93 Difference]: Finished difference Result 1029 states and 1700 transitions. [2018-11-06 19:50:53,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:53,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-06 19:50:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:53,462 INFO L225 Difference]: With dead ends: 1029 [2018-11-06 19:50:53,462 INFO L226 Difference]: Without dead ends: 661 [2018-11-06 19:50:53,465 INFO L604 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-11-06 19:50:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-11-06 19:50:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 656. [2018-11-06 19:50:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-06 19:50:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1012 transitions. [2018-11-06 19:50:53,500 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1012 transitions. Word has length 121 [2018-11-06 19:50:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:53,500 INFO L480 AbstractCegarLoop]: Abstraction has 656 states and 1012 transitions. [2018-11-06 19:50:53,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1012 transitions. [2018-11-06 19:50:53,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-06 19:50:53,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:53,505 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:53,505 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:53,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:53,505 INFO L82 PathProgramCache]: Analyzing trace with hash -930667760, now seen corresponding path program 1 times [2018-11-06 19:50:53,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:53,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:53,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:53,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:53,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:53,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:53,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:50:53,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:53,620 INFO L87 Difference]: Start difference. First operand 656 states and 1012 transitions. Second operand 3 states. [2018-11-06 19:50:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:56,167 INFO L93 Difference]: Finished difference Result 1874 states and 2935 transitions. [2018-11-06 19:50:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:56,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-11-06 19:50:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:56,176 INFO L225 Difference]: With dead ends: 1874 [2018-11-06 19:50:56,177 INFO L226 Difference]: Without dead ends: 1220 [2018-11-06 19:50:56,178 INFO L604 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-11-06 19:50:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2018-11-06 19:50:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1220. [2018-11-06 19:50:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-11-06 19:50:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1774 transitions. [2018-11-06 19:50:56,229 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1774 transitions. Word has length 127 [2018-11-06 19:50:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:56,229 INFO L480 AbstractCegarLoop]: Abstraction has 1220 states and 1774 transitions. [2018-11-06 19:50:56,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1774 transitions. [2018-11-06 19:50:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-06 19:50:56,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:56,236 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:56,236 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:56,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash 165815189, now seen corresponding path program 1 times [2018-11-06 19:50:56,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:56,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:56,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:56,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:56,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:56,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:56,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:56,453 INFO L87 Difference]: Start difference. First operand 1220 states and 1774 transitions. Second operand 4 states. [2018-11-06 19:50:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:57,853 INFO L93 Difference]: Finished difference Result 2442 states and 3553 transitions. [2018-11-06 19:50:57,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:57,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2018-11-06 19:50:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:57,861 INFO L225 Difference]: With dead ends: 2442 [2018-11-06 19:50:57,861 INFO L226 Difference]: Without dead ends: 1224 [2018-11-06 19:50:57,863 INFO L604 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-11-06 19:50:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2018-11-06 19:50:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2018-11-06 19:50:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-11-06 19:50:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1656 transitions. [2018-11-06 19:50:57,887 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1656 transitions. Word has length 135 [2018-11-06 19:50:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:57,888 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 1656 transitions. [2018-11-06 19:50:57,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1656 transitions. [2018-11-06 19:50:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-06 19:50:57,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:57,892 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:57,892 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:57,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:57,892 INFO L82 PathProgramCache]: Analyzing trace with hash -49604438, now seen corresponding path program 1 times [2018-11-06 19:50:57,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:57,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:57,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:57,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:57,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:58,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:58,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:50:58,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:58,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:58,088 INFO L87 Difference]: Start difference. First operand 1219 states and 1656 transitions. Second operand 4 states. [2018-11-06 19:50:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:59,336 INFO L93 Difference]: Finished difference Result 3977 states and 5371 transitions. [2018-11-06 19:50:59,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:59,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-11-06 19:50:59,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:59,351 INFO L225 Difference]: With dead ends: 3977 [2018-11-06 19:50:59,351 INFO L226 Difference]: Without dead ends: 2760 [2018-11-06 19:50:59,354 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2018-11-06 19:50:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2757. [2018-11-06 19:50:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2018-11-06 19:50:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3360 transitions. [2018-11-06 19:50:59,402 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3360 transitions. Word has length 140 [2018-11-06 19:50:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:59,402 INFO L480 AbstractCegarLoop]: Abstraction has 2757 states and 3360 transitions. [2018-11-06 19:50:59,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3360 transitions. [2018-11-06 19:50:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-06 19:50:59,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:59,408 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:59,408 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:59,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:59,409 INFO L82 PathProgramCache]: Analyzing trace with hash 169126387, now seen corresponding path program 1 times [2018-11-06 19:50:59,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:59,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:59,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:59,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:59,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-06 19:50:59,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:59,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:50:59,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:59,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:59,715 INFO L87 Difference]: Start difference. First operand 2757 states and 3360 transitions. Second operand 4 states. [2018-11-06 19:51:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:00,668 INFO L93 Difference]: Finished difference Result 5512 states and 6718 transitions. [2018-11-06 19:51:00,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:00,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-11-06 19:51:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:00,681 INFO L225 Difference]: With dead ends: 5512 [2018-11-06 19:51:00,682 INFO L226 Difference]: Without dead ends: 2757 [2018-11-06 19:51:00,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2018-11-06 19:51:00,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2757. [2018-11-06 19:51:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2018-11-06 19:51:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3190 transitions. [2018-11-06 19:51:00,737 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3190 transitions. Word has length 145 [2018-11-06 19:51:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:00,738 INFO L480 AbstractCegarLoop]: Abstraction has 2757 states and 3190 transitions. [2018-11-06 19:51:00,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3190 transitions. [2018-11-06 19:51:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-06 19:51:00,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:00,746 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:00,746 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:00,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1305079500, now seen corresponding path program 1 times [2018-11-06 19:51:00,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:00,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:00,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:00,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:00,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-06 19:51:00,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:00,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:00,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:00,905 INFO L87 Difference]: Start difference. First operand 2757 states and 3190 transitions. Second operand 3 states. [2018-11-06 19:51:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:01,754 INFO L93 Difference]: Finished difference Result 5367 states and 6203 transitions. [2018-11-06 19:51:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:01,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-11-06 19:51:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:01,774 INFO L225 Difference]: With dead ends: 5367 [2018-11-06 19:51:01,774 INFO L226 Difference]: Without dead ends: 2179 [2018-11-06 19:51:01,779 INFO L604 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-11-06 19:51:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states. [2018-11-06 19:51:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 2179. [2018-11-06 19:51:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2179 states. [2018-11-06 19:51:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2418 transitions. [2018-11-06 19:51:01,818 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2418 transitions. Word has length 212 [2018-11-06 19:51:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:01,819 INFO L480 AbstractCegarLoop]: Abstraction has 2179 states and 2418 transitions. [2018-11-06 19:51:01,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2418 transitions. [2018-11-06 19:51:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-06 19:51:01,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:01,826 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:01,826 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:01,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:01,827 INFO L82 PathProgramCache]: Analyzing trace with hash -931474898, now seen corresponding path program 1 times [2018-11-06 19:51:01,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:01,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:01,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:01,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-06 19:51:02,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:02,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:02,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:02,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:02,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:02,034 INFO L87 Difference]: Start difference. First operand 2179 states and 2418 transitions. Second operand 4 states. [2018-11-06 19:51:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:04,964 INFO L93 Difference]: Finished difference Result 4466 states and 4947 transitions. [2018-11-06 19:51:04,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:04,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2018-11-06 19:51:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:04,970 INFO L225 Difference]: With dead ends: 4466 [2018-11-06 19:51:04,971 INFO L226 Difference]: Without dead ends: 1287 [2018-11-06 19:51:04,974 INFO L604 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-11-06 19:51:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2018-11-06 19:51:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1287. [2018-11-06 19:51:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2018-11-06 19:51:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1378 transitions. [2018-11-06 19:51:04,995 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1378 transitions. Word has length 215 [2018-11-06 19:51:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:04,995 INFO L480 AbstractCegarLoop]: Abstraction has 1287 states and 1378 transitions. [2018-11-06 19:51:04,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1378 transitions. [2018-11-06 19:51:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-06 19:51:04,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:05,000 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:05,000 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:05,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1257654705, now seen corresponding path program 1 times [2018-11-06 19:51:05,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:05,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:05,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:05,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:05,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:05,313 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:51:05,532 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 19:51:05,826 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-06 19:51:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-06 19:51:05,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:51:05,890 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:51:05,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:06,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:51:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-06 19:51:06,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:51:06,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2018-11-06 19:51:06,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:51:06,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:51:06,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:51:06,174 INFO L87 Difference]: Start difference. First operand 1287 states and 1378 transitions. Second operand 7 states. [2018-11-06 19:51:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:12,058 INFO L93 Difference]: Finished difference Result 2886 states and 3085 transitions. [2018-11-06 19:51:12,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 19:51:12,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2018-11-06 19:51:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:12,066 INFO L225 Difference]: With dead ends: 2886 [2018-11-06 19:51:12,067 INFO L226 Difference]: Without dead ends: 1601 [2018-11-06 19:51:12,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:51:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2018-11-06 19:51:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1287. [2018-11-06 19:51:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2018-11-06 19:51:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1364 transitions. [2018-11-06 19:51:12,097 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1364 transitions. Word has length 226 [2018-11-06 19:51:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:12,098 INFO L480 AbstractCegarLoop]: Abstraction has 1287 states and 1364 transitions. [2018-11-06 19:51:12,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:51:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1364 transitions. [2018-11-06 19:51:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-06 19:51:12,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:12,103 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:12,104 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:12,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1229709314, now seen corresponding path program 1 times [2018-11-06 19:51:12,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:12,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:12,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-06 19:51:12,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:12,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:51:12,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:12,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:12,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:12,274 INFO L87 Difference]: Start difference. First operand 1287 states and 1364 transitions. Second operand 3 states. [2018-11-06 19:51:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:13,570 INFO L93 Difference]: Finished difference Result 3137 states and 3347 transitions. [2018-11-06 19:51:13,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:13,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2018-11-06 19:51:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:13,577 INFO L225 Difference]: With dead ends: 3137 [2018-11-06 19:51:13,577 INFO L226 Difference]: Without dead ends: 1710 [2018-11-06 19:51:13,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2018-11-06 19:51:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1569. [2018-11-06 19:51:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2018-11-06 19:51:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1646 transitions. [2018-11-06 19:51:13,609 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1646 transitions. Word has length 254 [2018-11-06 19:51:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:13,609 INFO L480 AbstractCegarLoop]: Abstraction has 1569 states and 1646 transitions. [2018-11-06 19:51:13,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1646 transitions. [2018-11-06 19:51:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-06 19:51:13,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:13,615 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:51:13,615 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:13,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1881802450, now seen corresponding path program 1 times [2018-11-06 19:51:13,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:13,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:13,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:13,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:13,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:13,900 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:51:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 162 proven. 5 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-06 19:51:14,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:51:14,052 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:51:14,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:14,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:51:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-06 19:51:14,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:51:14,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 19:51:14,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:51:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:51:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:51:14,450 INFO L87 Difference]: Start difference. First operand 1569 states and 1646 transitions. Second operand 5 states. [2018-11-06 19:51:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:16,412 INFO L93 Difference]: Finished difference Result 3135 states and 3298 transitions. [2018-11-06 19:51:16,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:51:16,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 260 [2018-11-06 19:51:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:16,414 INFO L225 Difference]: With dead ends: 3135 [2018-11-06 19:51:16,414 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:51:16,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:51:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:51:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:51:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:51:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:51:16,418 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2018-11-06 19:51:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:16,418 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:51:16,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:51:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:51:16,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:51:16,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:51:16,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:51:16,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:51:17,207 WARN L179 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-11-06 19:51:17,670 WARN L179 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-11-06 19:51:17,672 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,673 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,673 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,673 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-06 19:51:17,673 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-06 19:51:17,673 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-06 19:51:17,673 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-06 19:51:17,674 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-06 19:51:17,674 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-06 19:51:17,674 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-06 19:51:17,674 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,675 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,675 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,675 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-06 19:51:17,675 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-06 19:51:17,675 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-06 19:51:17,675 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-06 19:51:17,675 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-06 19:51:17,675 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-06 19:51:17,676 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-06 19:51:17,676 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,676 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,676 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,676 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-06 19:51:17,676 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-06 19:51:17,676 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-06 19:51:17,676 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-06 19:51:17,676 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-06 19:51:17,677 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,677 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,677 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,677 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-06 19:51:17,677 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-06 19:51:17,677 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-06 19:51:17,677 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-06 19:51:17,677 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-06 19:51:17,678 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-06 19:51:17,678 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-06 19:51:17,678 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-06 19:51:17,678 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,678 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,678 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,678 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-06 19:51:17,678 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-06 19:51:17,678 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-06 19:51:17,679 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-06 19:51:17,679 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-06 19:51:17,679 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-06 19:51:17,679 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-06 19:51:17,679 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-06 19:51:17,679 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,679 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,679 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,680 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-06 19:51:17,680 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-06 19:51:17,680 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-06 19:51:17,680 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-06 19:51:17,680 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-06 19:51:17,680 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-06 19:51:17,680 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-06 19:51:17,681 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-06 19:51:17,682 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-06 19:51:17,683 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,683 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,683 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,683 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-06 19:51:17,683 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-06 19:51:17,683 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-06 19:51:17,683 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-06 19:51:17,683 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-06 19:51:17,683 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,684 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,684 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,684 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-06 19:51:17,684 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-06 19:51:17,684 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-06 19:51:17,684 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-06 19:51:17,684 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-06 19:51:17,684 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-06 19:51:17,684 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-06 19:51:17,685 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-06 19:51:17,685 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-06 19:51:17,685 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-06 19:51:17,685 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:51:17,685 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-06 19:51:17,685 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,685 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,685 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-06 19:51:17,686 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-06 19:51:17,686 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-06 19:51:17,686 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-06 19:51:17,686 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-06 19:51:17,686 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-06 19:51:17,686 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-06 19:51:17,686 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-06 19:51:17,686 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-06 19:51:17,687 INFO L421 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse4 (= ~a11~0 1))) (let ((.cse7 (= ~a28~0 10)) (.cse0 (= ~a28~0 9)) (.cse8 (= ~a21~0 1)) (.cse2 (<= ~a25~0 0)) (.cse1 (= ~a19~0 1)) (.cse3 (<= ~a17~0 8)) (.cse6 (not (= ~a28~0 11))) (.cse9 (<= ~a19~0 0)) (.cse5 (= ~a17~0 8)) (.cse12 (= ~a28~0 7)) (.cse10 (= ~a25~0 1)) (.cse11 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse4 .cse6) (and .cse7 .cse5 .cse1 .cse8 .cse2) (and .cse0 .cse9 .cse10 .cse4) (and .cse7 .cse9 .cse5 .cse10 .cse11) (and .cse5 .cse1 .cse12 .cse8 .cse2) (and .cse5 .cse1 .cse10 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5 .cse1 .cse8 .cse10 .cse11) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse5 .cse2 .cse6) (and .cse9 .cse2 .cse4 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse6) (and .cse9 .cse5 .cse12 .cse10 .cse11)))) [2018-11-06 19:51:17,687 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,688 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,688 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-06 19:51:17,688 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-06 19:51:17,688 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-06 19:51:17,688 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-06 19:51:17,688 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-06 19:51:17,688 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-06 19:51:17,688 INFO L428 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2018-11-06 19:51:17,689 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,689 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,689 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-06 19:51:17,689 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-06 19:51:17,689 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-06 19:51:17,689 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-06 19:51:17,689 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-06 19:51:17,689 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-06 19:51:17,689 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-06 19:51:17,690 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-06 19:51:17,690 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-06 19:51:17,690 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,690 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,690 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-06 19:51:17,690 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-06 19:51:17,690 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-06 19:51:17,690 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-06 19:51:17,691 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-06 19:51:17,691 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-06 19:51:17,691 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-06 19:51:17,691 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,691 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse4 (= ~a11~0 1))) (let ((.cse7 (= ~a28~0 10)) (.cse0 (= ~a28~0 9)) (.cse8 (= ~a21~0 1)) (.cse2 (<= ~a25~0 0)) (.cse1 (= ~a19~0 1)) (.cse3 (<= ~a17~0 8)) (.cse6 (not (= ~a28~0 11))) (.cse9 (<= ~a19~0 0)) (.cse5 (= ~a17~0 8)) (.cse12 (= ~a28~0 7)) (.cse10 (= ~a25~0 1)) (.cse11 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse4 .cse6) (and .cse7 .cse5 .cse1 .cse8 .cse2) (and .cse0 .cse9 .cse10 .cse4) (and .cse7 .cse9 .cse5 .cse10 .cse11) (and .cse5 .cse1 .cse12 .cse8 .cse2) (and .cse5 .cse1 .cse10 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5 .cse1 .cse8 .cse10 .cse11) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse5 .cse2 .cse6) (and .cse9 .cse2 .cse4 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse6) (and .cse9 .cse5 .cse12 .cse10 .cse11)))) [2018-11-06 19:51:17,691 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-06 19:51:17,692 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-06 19:51:17,693 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,694 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-06 19:51:17,694 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-06 19:51:17,694 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-06 19:51:17,694 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-06 19:51:17,694 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-06 19:51:17,694 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:51:17,694 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-06 19:51:17,694 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,694 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,695 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,695 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-06 19:51:17,695 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-06 19:51:17,695 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-06 19:51:17,695 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-06 19:51:17,695 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-06 19:51:17,695 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,695 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,695 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,696 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-06 19:51:17,696 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-06 19:51:17,696 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-06 19:51:17,696 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-06 19:51:17,696 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-06 19:51:17,696 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-06 19:51:17,696 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,696 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-06 19:51:17,697 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-06 19:51:17,698 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 517) no Hoare annotation was computed. [2018-11-06 19:51:17,698 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,698 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,698 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,698 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-06 19:51:17,698 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-06 19:51:17,698 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-06 19:51:17,698 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-06 19:51:17,698 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-06 19:51:17,699 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,699 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,699 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:17,699 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-06 19:51:17,699 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-06 19:51:17,699 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-06 19:51:17,699 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-06 19:51:17,699 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-06 19:51:17,699 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-06 19:51:17,700 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-06 19:51:17,700 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-06 19:51:17,700 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-06 19:51:17,700 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-06 19:51:17,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:51:17 BoogieIcfgContainer [2018-11-06 19:51:17,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:51:17,726 INFO L168 Benchmark]: Toolchain (without parser) took 33807.18 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.3 MB). Peak memory consumption was 280.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:17,727 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:51:17,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:17,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 208.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:17,730 INFO L168 Benchmark]: Boogie Preprocessor took 90.85 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:51:17,730 INFO L168 Benchmark]: RCFGBuilder took 3341.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:17,731 INFO L168 Benchmark]: TraceAbstraction took 29485.38 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 350.2 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -128.9 MB). Peak memory consumption was 221.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:17,736 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 676.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 208.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.85 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3341.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29485.38 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 350.2 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -128.9 MB). Peak memory consumption was 221.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 517]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((a28 == 9 && a19 == 1) && a25 <= 0) && a17 <= 8) && a11 == 1) || ((((a17 == 8 && a19 == 1) && a25 <= 0) && a11 == 1) && !(a28 == 11))) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || (((a28 == 9 && a19 <= 0) && a25 == 1) && a11 == 1)) || ((((a28 == 10 && a19 <= 0) && a17 == 8) && a25 == 1) && !(a11 == 1))) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && a25 <= 0)) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || ((((a28 == 10 && a19 == 1) && a25 <= 0) && a17 <= 8) && a11 == 1)) || (((((!(3 == input) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) && !(a11 == 1))) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || (((a19 <= 0 && a17 == 8) && a25 <= 0) && !(a28 == 11))) || (((a19 <= 0 && a25 <= 0) && a11 == 1) && !(a28 == 11))) || ((((a19 == 1 && a25 == 1) && a17 <= 8) && a11 == 1) && !(a28 == 11))) || ((((a19 <= 0 && a17 == 8) && a28 == 7) && a25 == 1) && !(a11 == 1)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((((a28 == 9 && a19 == 1) && a25 <= 0) && a17 <= 8) && a11 == 1) || ((((a17 == 8 && a19 == 1) && a25 <= 0) && a11 == 1) && !(a28 == 11))) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || (((a28 == 9 && a19 <= 0) && a25 == 1) && a11 == 1)) || ((((a28 == 10 && a19 <= 0) && a17 == 8) && a25 == 1) && !(a11 == 1))) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && a25 <= 0)) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || ((((a28 == 10 && a19 == 1) && a25 <= 0) && a17 <= 8) && a11 == 1)) || (((((!(3 == input) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) && !(a11 == 1))) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || (((a19 <= 0 && a17 == 8) && a25 <= 0) && !(a28 == 11))) || (((a19 <= 0 && a25 <= 0) && a11 == 1) && !(a28 == 11))) || ((((a19 == 1 && a25 == 1) && a17 <= 8) && a11 == 1) && !(a28 == 11))) || ((((a19 <= 0 && a17 == 8) && a28 == 7) && a25 == 1) && !(a11 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 228 locations, 1 error locations. SAFE Result, 29.3s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1740 SDtfs, 3027 SDslu, 670 SDs, 0 SdLazy, 6855 SolverSat, 1252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 499 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2757occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 642 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 451 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1082 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 458 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2424 ConstructedInterpolants, 0 QuantifiedInterpolants, 987964 SizeOfPredicates, 6 NumberOfNonLiveVariables, 782 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1433/1441 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...