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/Problem01_label01_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:47:28,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:47:28,297 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:47:28,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:47:28,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:47:28,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:47:28,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:47:28,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:47:28,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:47:28,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:47:28,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:47:28,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:47:28,321 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:47:28,322 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:47:28,323 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:47:28,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:47:28,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:47:28,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:47:28,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:47:28,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:47:28,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:47:28,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:47:28,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:47:28,336 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:47:28,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:47:28,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:47:28,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:47:28,339 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:47:28,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:47:28,341 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:47:28,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:47:28,342 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:47:28,342 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:47:28,342 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:47:28,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:47:28,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:47:28,344 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:47:28,362 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:47:28,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:47:28,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:47:28,366 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:47:28,367 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:47:28,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:47:28,367 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:47:28,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:47:28,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:47:28,368 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:47:28,368 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:47:28,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:47:28,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:47:28,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:47:28,369 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:47:28,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:47:28,369 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:47:28,369 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:47:28,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:47:28,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:47:28,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:47:28,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:47:28,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:47:28,370 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:47:28,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:47:28,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:47:28,372 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:47:28,372 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:47:28,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:47:28,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:47:28,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:47:28,446 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:47:28,447 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:47:28,447 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label01_true-unreach-call_false-termination.c [2018-11-06 19:47:28,515 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e332b35/7fafc39e55a044afb824217e629b19d9/FLAGc3d7d11bd [2018-11-06 19:47:29,105 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:47:29,106 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label01_true-unreach-call_false-termination.c [2018-11-06 19:47:29,128 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e332b35/7fafc39e55a044afb824217e629b19d9/FLAGc3d7d11bd [2018-11-06 19:47:29,150 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e332b35/7fafc39e55a044afb824217e629b19d9 [2018-11-06 19:47:29,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:47:29,161 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:47:29,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:47:29,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:47:29,170 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:47:29,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:47:29" (1/1) ... [2018-11-06 19:47:29,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30acf376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29, skipping insertion in model container [2018-11-06 19:47:29,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:47:29" (1/1) ... [2018-11-06 19:47:29,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:47:29,264 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:47:29,774 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:47:29,779 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:47:29,915 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:47:29,933 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:47:29,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29 WrapperNode [2018-11-06 19:47:29,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:47:29,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:47:29,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:47:29,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:47:29,946 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:47:29" (1/1) ... [2018-11-06 19:47:30,055 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:47:29" (1/1) ... [2018-11-06 19:47:30,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:47:30,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:47:30,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:47:30,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:47:30,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2018-11-06 19:47:30,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2018-11-06 19:47:30,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2018-11-06 19:47:30,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2018-11-06 19:47:30,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2018-11-06 19:47:30,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2018-11-06 19:47:30,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (1/1) ... [2018-11-06 19:47:30,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:47:30,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:47:30,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:47:30,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:47:30,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (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:47:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:47:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:47:30,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:47:33,709 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:47:33,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:47:33 BoogieIcfgContainer [2018-11-06 19:47:33,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:47:33,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:47:33,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:47:33,716 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:47:33,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:47:29" (1/3) ... [2018-11-06 19:47:33,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0666a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:47:33, skipping insertion in model container [2018-11-06 19:47:33,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:29" (2/3) ... [2018-11-06 19:47:33,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0666a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:47:33, skipping insertion in model container [2018-11-06 19:47:33,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:47:33" (3/3) ... [2018-11-06 19:47:33,722 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label01_true-unreach-call_false-termination.c [2018-11-06 19:47:33,734 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:47:33,745 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:47:33,765 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:47:33,803 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:47:33,804 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:47:33,804 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:47:33,804 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:47:33,804 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:47:33,805 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:47:33,805 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:47:33,805 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:47:33,805 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:47:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:47:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-06 19:47:33,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:33,843 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] [2018-11-06 19:47:33,845 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:33,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1762588673, now seen corresponding path program 1 times [2018-11-06 19:47:33,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:33,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:33,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:33,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:34,480 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:47:34,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:34,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:47:34,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:47:34,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:47:34,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:47:34,511 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-11-06 19:47:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:36,950 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-11-06 19:47:36,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:47:36,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-06 19:47:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:36,973 INFO L225 Difference]: With dead ends: 666 [2018-11-06 19:47:36,974 INFO L226 Difference]: Without dead ends: 460 [2018-11-06 19:47:36,978 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:47:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-11-06 19:47:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-11-06 19:47:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-06 19:47:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 743 transitions. [2018-11-06 19:47:37,054 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 743 transitions. Word has length 92 [2018-11-06 19:47:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:37,055 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 743 transitions. [2018-11-06 19:47:37,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:47:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 743 transitions. [2018-11-06 19:47:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-06 19:47:37,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:37,061 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:47:37,061 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:37,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1307148936, now seen corresponding path program 1 times [2018-11-06 19:47:37,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:37,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:37,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:47:37,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:37,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:47:37,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:47:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:47:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:47:37,195 INFO L87 Difference]: Start difference. First operand 460 states and 743 transitions. Second operand 4 states. [2018-11-06 19:47:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:38,339 INFO L93 Difference]: Finished difference Result 1314 states and 2164 transitions. [2018-11-06 19:47:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:47:38,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-06 19:47:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:38,347 INFO L225 Difference]: With dead ends: 1314 [2018-11-06 19:47:38,347 INFO L226 Difference]: Without dead ends: 856 [2018-11-06 19:47:38,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:47:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-06 19:47:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-06 19:47:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-06 19:47:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1279 transitions. [2018-11-06 19:47:38,419 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1279 transitions. Word has length 98 [2018-11-06 19:47:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:38,419 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1279 transitions. [2018-11-06 19:47:38,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:47:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1279 transitions. [2018-11-06 19:47:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-06 19:47:38,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:38,425 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:47:38,425 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:38,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash 425946569, now seen corresponding path program 1 times [2018-11-06 19:47:38,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:38,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:38,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:47:38,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:38,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:47:38,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:47:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:47:38,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:47:38,541 INFO L87 Difference]: Start difference. First operand 856 states and 1279 transitions. Second operand 3 states. [2018-11-06 19:47:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:40,991 INFO L93 Difference]: Finished difference Result 2106 states and 3236 transitions. [2018-11-06 19:47:40,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:47:40,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-11-06 19:47:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:40,999 INFO L225 Difference]: With dead ends: 2106 [2018-11-06 19:47:41,000 INFO L226 Difference]: Without dead ends: 1252 [2018-11-06 19:47:41,002 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:47:41,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-11-06 19:47:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-11-06 19:47:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-11-06 19:47:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1911 transitions. [2018-11-06 19:47:41,036 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1911 transitions. Word has length 120 [2018-11-06 19:47:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:41,036 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1911 transitions. [2018-11-06 19:47:41,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:47:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1911 transitions. [2018-11-06 19:47:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-06 19:47:41,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:41,042 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:47:41,042 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:41,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash 637057050, now seen corresponding path program 1 times [2018-11-06 19:47:41,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:41,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:41,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:41,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:41,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-06 19:47:41,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:41,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:47:41,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:47:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:47:41,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:47:41,268 INFO L87 Difference]: Start difference. First operand 1252 states and 1911 transitions. Second operand 3 states. [2018-11-06 19:47:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:42,415 INFO L93 Difference]: Finished difference Result 3294 states and 4988 transitions. [2018-11-06 19:47:42,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:47:42,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2018-11-06 19:47:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:42,427 INFO L225 Difference]: With dead ends: 3294 [2018-11-06 19:47:42,427 INFO L226 Difference]: Without dead ends: 2044 [2018-11-06 19:47:42,429 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:47:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-11-06 19:47:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2018-11-06 19:47:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-11-06 19:47:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2875 transitions. [2018-11-06 19:47:42,471 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2875 transitions. Word has length 158 [2018-11-06 19:47:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:42,471 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 2875 transitions. [2018-11-06 19:47:42,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:47:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2875 transitions. [2018-11-06 19:47:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-06 19:47:42,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:42,477 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:47:42,478 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:42,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1666227303, now seen corresponding path program 1 times [2018-11-06 19:47:42,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:42,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:42,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:42,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 19:47:42,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:42,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:47:42,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:47:42,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:47:42,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:47:42,634 INFO L87 Difference]: Start difference. First operand 2044 states and 2875 transitions. Second operand 3 states. [2018-11-06 19:47:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:43,351 INFO L93 Difference]: Finished difference Result 5802 states and 8113 transitions. [2018-11-06 19:47:43,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:47:43,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-11-06 19:47:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:43,365 INFO L225 Difference]: With dead ends: 5802 [2018-11-06 19:47:43,365 INFO L226 Difference]: Without dead ends: 3760 [2018-11-06 19:47:43,369 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:47:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2018-11-06 19:47:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3760. [2018-11-06 19:47:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3760 states. [2018-11-06 19:47:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 4970 transitions. [2018-11-06 19:47:43,436 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 4970 transitions. Word has length 178 [2018-11-06 19:47:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:43,437 INFO L480 AbstractCegarLoop]: Abstraction has 3760 states and 4970 transitions. [2018-11-06 19:47:43,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:47:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4970 transitions. [2018-11-06 19:47:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 19:47:43,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:43,444 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:47:43,445 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:43,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:43,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1532709885, now seen corresponding path program 1 times [2018-11-06 19:47:43,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:43,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:43,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:43,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:47:43,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:43,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:47:43,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:47:43,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:47:43,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:47:43,636 INFO L87 Difference]: Start difference. First operand 3760 states and 4970 transitions. Second operand 3 states. [2018-11-06 19:47:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:44,525 INFO L93 Difference]: Finished difference Result 7650 states and 10133 transitions. [2018-11-06 19:47:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:47:44,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-11-06 19:47:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:44,539 INFO L225 Difference]: With dead ends: 7650 [2018-11-06 19:47:44,539 INFO L226 Difference]: Without dead ends: 3892 [2018-11-06 19:47:44,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:47:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2018-11-06 19:47:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3892. [2018-11-06 19:47:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-11-06 19:47:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5084 transitions. [2018-11-06 19:47:44,613 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5084 transitions. Word has length 180 [2018-11-06 19:47:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:44,614 INFO L480 AbstractCegarLoop]: Abstraction has 3892 states and 5084 transitions. [2018-11-06 19:47:44,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:47:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5084 transitions. [2018-11-06 19:47:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-06 19:47:44,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:44,622 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:47:44,622 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:44,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1084510043, now seen corresponding path program 1 times [2018-11-06 19:47:44,623 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:44,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:45,065 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-11-06 19:47:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:47:45,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:45,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:47:45,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:47:45,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:47:45,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:47:45,182 INFO L87 Difference]: Start difference. First operand 3892 states and 5084 transitions. Second operand 7 states. [2018-11-06 19:47:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:46,682 INFO L93 Difference]: Finished difference Result 7846 states and 10230 transitions. [2018-11-06 19:47:46,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:47:46,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2018-11-06 19:47:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:46,705 INFO L225 Difference]: With dead ends: 7846 [2018-11-06 19:47:46,706 INFO L226 Difference]: Without dead ends: 3956 [2018-11-06 19:47:46,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:47:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2018-11-06 19:47:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3892. [2018-11-06 19:47:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-11-06 19:47:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5066 transitions. [2018-11-06 19:47:46,822 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5066 transitions. Word has length 185 [2018-11-06 19:47:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:46,822 INFO L480 AbstractCegarLoop]: Abstraction has 3892 states and 5066 transitions. [2018-11-06 19:47:46,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:47:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5066 transitions. [2018-11-06 19:47:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-06 19:47:46,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:46,830 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:47:46,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:46,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash -285779924, now seen corresponding path program 1 times [2018-11-06 19:47:46,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:46,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:46,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:47,327 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 19:47:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-06 19:47:47,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:47,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:47:47,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:47:47,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:47:47,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:47:47,358 INFO L87 Difference]: Start difference. First operand 3892 states and 5066 transitions. Second operand 4 states. [2018-11-06 19:47:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:50,993 INFO L93 Difference]: Finished difference Result 8320 states and 10864 transitions. [2018-11-06 19:47:50,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:47:50,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2018-11-06 19:47:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:51,007 INFO L225 Difference]: With dead ends: 8320 [2018-11-06 19:47:51,007 INFO L226 Difference]: Without dead ends: 4430 [2018-11-06 19:47:51,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:47:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2018-11-06 19:47:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 4430. [2018-11-06 19:47:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4430 states. [2018-11-06 19:47:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 5443 transitions. [2018-11-06 19:47:51,079 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 5443 transitions. Word has length 218 [2018-11-06 19:47:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:51,079 INFO L480 AbstractCegarLoop]: Abstraction has 4430 states and 5443 transitions. [2018-11-06 19:47:51,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:47:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 5443 transitions. [2018-11-06 19:47:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-06 19:47:51,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:51,090 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-06 19:47:51,090 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:51,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1957431819, now seen corresponding path program 1 times [2018-11-06 19:47:51,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:51,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:51,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:51,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-06 19:47:51,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:51,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:47:51,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:47:51,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:47:51,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:47:51,347 INFO L87 Difference]: Start difference. First operand 4430 states and 5443 transitions. Second operand 4 states. [2018-11-06 19:47:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:52,793 INFO L93 Difference]: Finished difference Result 12158 states and 14876 transitions. [2018-11-06 19:47:52,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:47:52,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2018-11-06 19:47:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:52,820 INFO L225 Difference]: With dead ends: 12158 [2018-11-06 19:47:52,820 INFO L226 Difference]: Without dead ends: 7730 [2018-11-06 19:47:52,825 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:47:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7730 states. [2018-11-06 19:47:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7730 to 7730. [2018-11-06 19:47:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7730 states. [2018-11-06 19:47:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7730 states to 7730 states and 9228 transitions. [2018-11-06 19:47:52,935 INFO L78 Accepts]: Start accepts. Automaton has 7730 states and 9228 transitions. Word has length 244 [2018-11-06 19:47:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:52,935 INFO L480 AbstractCegarLoop]: Abstraction has 7730 states and 9228 transitions. [2018-11-06 19:47:52,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:47:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 7730 states and 9228 transitions. [2018-11-06 19:47:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-06 19:47:52,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:52,946 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:47:52,947 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:52,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:52,947 INFO L82 PathProgramCache]: Analyzing trace with hash -773747236, now seen corresponding path program 1 times [2018-11-06 19:47:52,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:52,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:52,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:52,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:52,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:53,332 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:47:53,592 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:47:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-06 19:47:53,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:47:53,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:47:53,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:47:53,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:47:53,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:47:53,670 INFO L87 Difference]: Start difference. First operand 7730 states and 9228 transitions. Second operand 6 states. [2018-11-06 19:47:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:47:55,307 INFO L93 Difference]: Finished difference Result 15354 states and 18264 transitions. [2018-11-06 19:47:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:47:55,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2018-11-06 19:47:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:47:55,324 INFO L225 Difference]: With dead ends: 15354 [2018-11-06 19:47:55,324 INFO L226 Difference]: Without dead ends: 7758 [2018-11-06 19:47:55,332 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:47:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7758 states. [2018-11-06 19:47:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7758 to 7196. [2018-11-06 19:47:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7196 states. [2018-11-06 19:47:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 8212 transitions. [2018-11-06 19:47:55,508 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 8212 transitions. Word has length 266 [2018-11-06 19:47:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:47:55,508 INFO L480 AbstractCegarLoop]: Abstraction has 7196 states and 8212 transitions. [2018-11-06 19:47:55,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:47:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 8212 transitions. [2018-11-06 19:47:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-06 19:47:55,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:47:55,520 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:47:55,521 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:47:55,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:47:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash -381238779, now seen corresponding path program 1 times [2018-11-06 19:47:55,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:47:55,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:47:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:55,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:47:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:55,963 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:47:56,242 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-11-06 19:47:56,578 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-06 19:47:56,807 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-11-06 19:47:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 364 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-06 19:47:57,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:47:57,186 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:47:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:47:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:47:57,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:47:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-06 19:47:57,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:47:57,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-11-06 19:47:57,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 19:47:57,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 19:47:57,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:47:57,646 INFO L87 Difference]: Start difference. First operand 7196 states and 8212 transitions. Second operand 14 states. [2018-11-06 19:48:01,254 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-06 19:48:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:02,006 INFO L93 Difference]: Finished difference Result 11902 states and 13491 transitions. [2018-11-06 19:48:02,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 19:48:02,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 288 [2018-11-06 19:48:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:02,007 INFO L225 Difference]: With dead ends: 11902 [2018-11-06 19:48:02,007 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:48:02,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-11-06 19:48:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:48:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:48:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:48:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:48:02,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 288 [2018-11-06 19:48:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:02,015 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:48:02,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 19:48:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:48:02,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:48:02,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:48:02,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,164 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 77 [2018-11-06 19:48:02,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:02,305 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 77 [2018-11-06 19:48:03,162 WARN L179 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-11-06 19:48:03,530 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-11-06 19:48:03,534 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:48:03,534 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:48:03,534 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,534 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,534 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,534 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,534 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,534 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,535 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:48:03,535 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:48:03,535 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:48:03,535 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:48:03,535 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:48:03,535 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:48:03,535 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:48:03,535 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:48:03,535 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:48:03,536 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:48:03,537 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:48:03,538 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:48:03,538 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:48:03,538 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,538 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,538 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,538 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,538 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,538 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:48:03,539 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:48:03,539 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:48:03,539 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:48:03,539 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:48:03,539 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:48:03,539 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:48:03,539 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:48:03,539 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:48:03,540 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse12 (= ~a16~0 6)) (.cse7 (= ~a7~0 1))) (let ((.cse10 (= ~a16~0 4)) (.cse8 (<= ~a21~0 0)) (.cse9 (= ~a8~0 13)) (.cse11 (<= ~a17~0 0)) (.cse5 (= ~a20~0 1)) (.cse6 (not .cse7)) (.cse3 (not .cse12)) (.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (not .cse4))) (or (and .cse0 .cse1 .cse2 (= ~a16~0 5)) (and .cse3 .cse0 .cse4 .cse1 .cse5) (and .cse6 .cse0 .cse4 .cse1 .cse5) (and .cse6 (= ~a8~0 15) .cse0 .cse1) (and .cse7 .cse8 .cse3 .cse9 .cse4 .cse0) (and .cse10 .cse0 .cse11 .cse1) (and .cse7 .cse8 .cse10 .cse9 .cse0 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse11 .cse5 .cse12 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse6 .cse3 .cse0 .cse1 .cse2)))) [2018-11-06 19:48:03,540 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,540 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,540 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,540 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 449) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:48:03,541 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:48:03,542 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:48:03,543 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:48:03,544 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:48:03,545 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:48:03,545 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:48:03,545 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:48:03,545 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:48:03,545 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,545 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,545 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,546 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse12 (= ~a16~0 6)) (.cse7 (= ~a7~0 1))) (let ((.cse10 (= ~a16~0 4)) (.cse8 (<= ~a21~0 0)) (.cse9 (= ~a8~0 13)) (.cse11 (<= ~a17~0 0)) (.cse5 (= ~a20~0 1)) (.cse6 (not .cse7)) (.cse3 (not .cse12)) (.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (not .cse4))) (or (and .cse0 .cse1 .cse2 (= ~a16~0 5)) (and .cse3 .cse0 .cse4 .cse1 .cse5) (and .cse6 .cse0 .cse4 .cse1 .cse5) (and .cse6 (= ~a8~0 15) .cse0 .cse1) (and .cse7 .cse8 .cse3 .cse9 .cse4 .cse0) (and .cse10 .cse0 .cse11 .cse1) (and .cse7 .cse8 .cse10 .cse9 .cse0 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse11 .cse5 .cse12 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse6 .cse3 .cse0 .cse1 .cse2)))) [2018-11-06 19:48:03,546 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,546 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,546 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:48:03,546 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:48:03,546 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:48:03,546 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:48:03,546 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:48:03,546 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:48:03,547 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:48:03,548 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:48:03,549 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:48:03,550 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:48:03,550 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:48:03,550 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:48:03,550 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:48:03,550 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:48:03,550 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:48:03,550 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:48:03,550 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:48:03,550 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:48:03,551 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:48:03,552 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:48:03,553 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:48:03,553 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:48:03,553 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:48:03,553 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,553 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,553 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,553 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,553 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,553 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:48:03,554 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:48:03,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:48:03 BoogieIcfgContainer [2018-11-06 19:48:03,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:48:03,589 INFO L168 Benchmark]: Toolchain (without parser) took 34428.80 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 1.6 GB in the end (delta: -196.9 MB). Peak memory consumption was 916.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:48:03,591 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:48:03,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.36 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:48:03,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:48:03,595 INFO L168 Benchmark]: Boogie Preprocessor took 92.68 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:48:03,596 INFO L168 Benchmark]: RCFGBuilder took 3490.80 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: 118.2 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:48:03,597 INFO L168 Benchmark]: TraceAbstraction took 29876.74 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 371.7 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 470.3 MB). Peak memory consumption was 842.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:48:03,604 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 769.36 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 190.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 92.68 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 3490.80 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: 118.2 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29876.74 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 371.7 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 470.3 MB). Peak memory consumption was 842.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 449]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((a12 == 8 && a21 == 1) && !(a17 == 1)) && a16 == 5) || ((((!(a16 == 6) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((((!(a7 == 1) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((a12 == 8 && a21 == 1) && !(a17 == 1)) && a16 == 5) || ((((!(a16 == 6) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((((!(a7 == 1) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 29.7s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 21.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1812 SDtfs, 3164 SDslu, 943 SDs, 0 SdLazy, 8173 SolverSat, 1556 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 301 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7730occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 626 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 80 NumberOfFragments, 345 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4631 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 274 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2315 NumberOfCodeBlocks, 2315 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2303 ConstructedInterpolants, 0 QuantifiedInterpolants, 1680387 SizeOfPredicates, 1 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2855/2865 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...