java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:50:55,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:50:55,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:50:55,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:50:55,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:50:55,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:50:55,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:50:55,364 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:50:55,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:50:55,367 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:50:55,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:50:55,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:50:55,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:50:55,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:50:55,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:50:55,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:50:55,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:50:55,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:50:55,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:50:55,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:50:55,395 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:50:55,396 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:50:55,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:50:55,399 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:50:55,399 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:50:55,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:50:55,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:50:55,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:50:55,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:50:55,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:50:55,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:50:55,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:50:55,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:50:55,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:50:55,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:50:55,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:50:55,407 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:50:55,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:50:55,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:50:55,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:50:55,426 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:50:55,426 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:50:55,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:50:55,427 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:50:55,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:50:55,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:50:55,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:50:55,428 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:50:55,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:50:55,428 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:50:55,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:50:55,428 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:50:55,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:50:55,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:50:55,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:50:55,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:50:55,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:50:55,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:50:55,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:50:55,430 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:50:55,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:50:55,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:50:55,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:50:55,431 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:50:55,431 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:50:55,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:50:55,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:50:55,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:50:55,492 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:50:55,493 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:50:55,494 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-06 19:50:55,563 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea5493940/d797257a40f542d18b887324e1cfea39/FLAGad8479bc1 [2018-11-06 19:50:56,075 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:50:56,076 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-06 19:50:56,093 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea5493940/d797257a40f542d18b887324e1cfea39/FLAGad8479bc1 [2018-11-06 19:50:56,114 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea5493940/d797257a40f542d18b887324e1cfea39 [2018-11-06 19:50:56,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:50:56,130 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:50:56,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:50:56,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:50:56,136 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:50:56,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:56,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5e0fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56, skipping insertion in model container [2018-11-06 19:50:56,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:56,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:50:56,219 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:50:56,659 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:50:56,664 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:50:56,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:50:56,848 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:50:56,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56 WrapperNode [2018-11-06 19:50:56,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:50:56,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:50:56,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:50:56,850 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:50:56,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:56,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:57,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:50:57,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:50:57,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:50:57,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:50:57,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:57,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:57,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:57,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:57,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:57,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:57,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... [2018-11-06 19:50:57,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:50:57,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:50:57,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:50:57,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:50:57,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:50:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:50:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:50:57,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:51:00,283 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:51:00,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:51:00 BoogieIcfgContainer [2018-11-06 19:51:00,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:51:00,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:51:00,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:51:00,289 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:51:00,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:50:56" (1/3) ... [2018-11-06 19:51:00,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d45dcfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:51:00, skipping insertion in model container [2018-11-06 19:51:00,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:56" (2/3) ... [2018-11-06 19:51:00,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d45dcfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:51:00, skipping insertion in model container [2018-11-06 19:51:00,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:51:00" (3/3) ... [2018-11-06 19:51:00,294 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-11-06 19:51:00,305 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:51:00,316 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:51:00,334 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:51:00,373 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:51:00,374 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:51:00,374 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:51:00,374 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:51:00,374 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:51:00,376 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:51:00,376 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:51:00,376 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:51:00,376 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:51:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2018-11-06 19:51:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-06 19:51:00,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:00,421 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:00,424 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:00,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:00,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1186740725, now seen corresponding path program 1 times [2018-11-06 19:51:00,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:00,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:00,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:00,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:01,183 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:51:01,254 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:51:01,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:01,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:01,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:01,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:01,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:01,293 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 4 states. [2018-11-06 19:51:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:04,611 INFO L93 Difference]: Finished difference Result 752 states and 1329 transitions. [2018-11-06 19:51:04,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:04,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-11-06 19:51:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:04,636 INFO L225 Difference]: With dead ends: 752 [2018-11-06 19:51:04,636 INFO L226 Difference]: Without dead ends: 517 [2018-11-06 19:51:04,641 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-06 19:51:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 512. [2018-11-06 19:51:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-11-06 19:51:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 798 transitions. [2018-11-06 19:51:04,729 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 798 transitions. Word has length 141 [2018-11-06 19:51:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:04,731 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 798 transitions. [2018-11-06 19:51:04,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 798 transitions. [2018-11-06 19:51:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-06 19:51:04,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:04,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:04,739 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:04,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1335386953, now seen corresponding path program 1 times [2018-11-06 19:51:04,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:04,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:04,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:04,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:04,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:05,228 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 19:51:05,702 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:51:05,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:05,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-06 19:51:05,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:51:05,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:51:05,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:51:05,706 INFO L87 Difference]: Start difference. First operand 512 states and 798 transitions. Second operand 9 states. [2018-11-06 19:51:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:08,049 INFO L93 Difference]: Finished difference Result 1526 states and 2435 transitions. [2018-11-06 19:51:08,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 19:51:08,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2018-11-06 19:51:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:08,058 INFO L225 Difference]: With dead ends: 1526 [2018-11-06 19:51:08,058 INFO L226 Difference]: Without dead ends: 937 [2018-11-06 19:51:08,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:51:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-11-06 19:51:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2018-11-06 19:51:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-11-06 19:51:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1275 transitions. [2018-11-06 19:51:08,121 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1275 transitions. Word has length 147 [2018-11-06 19:51:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:08,121 INFO L480 AbstractCegarLoop]: Abstraction has 937 states and 1275 transitions. [2018-11-06 19:51:08,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:51:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1275 transitions. [2018-11-06 19:51:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-06 19:51:08,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:08,132 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:08,132 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:08,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:08,133 INFO L82 PathProgramCache]: Analyzing trace with hash -131957002, now seen corresponding path program 1 times [2018-11-06 19:51:08,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:08,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:08,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:08,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-06 19:51:08,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:08,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:08,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:08,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:08,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:08,446 INFO L87 Difference]: Start difference. First operand 937 states and 1275 transitions. Second operand 4 states. [2018-11-06 19:51:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:11,625 INFO L93 Difference]: Finished difference Result 2755 states and 3944 transitions. [2018-11-06 19:51:11,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:11,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-11-06 19:51:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:11,636 INFO L225 Difference]: With dead ends: 2755 [2018-11-06 19:51:11,637 INFO L226 Difference]: Without dead ends: 1820 [2018-11-06 19:51:11,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2018-11-06 19:51:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1360. [2018-11-06 19:51:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-11-06 19:51:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1802 transitions. [2018-11-06 19:51:11,674 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1802 transitions. Word has length 170 [2018-11-06 19:51:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:11,674 INFO L480 AbstractCegarLoop]: Abstraction has 1360 states and 1802 transitions. [2018-11-06 19:51:11,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1802 transitions. [2018-11-06 19:51:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-06 19:51:11,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:11,680 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:11,680 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:11,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 626602045, now seen corresponding path program 1 times [2018-11-06 19:51:11,681 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:11,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:11,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-06 19:51:11,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:11,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:11,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:11,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:11,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:11,853 INFO L87 Difference]: Start difference. First operand 1360 states and 1802 transitions. Second operand 3 states. [2018-11-06 19:51:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:13,271 INFO L93 Difference]: Finished difference Result 3703 states and 4865 transitions. [2018-11-06 19:51:13,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:13,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-11-06 19:51:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:13,279 INFO L225 Difference]: With dead ends: 3703 [2018-11-06 19:51:13,280 INFO L226 Difference]: Without dead ends: 1467 [2018-11-06 19:51:13,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-11-06 19:51:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2018-11-06 19:51:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2018-11-06 19:51:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1681 transitions. [2018-11-06 19:51:13,310 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1681 transitions. Word has length 237 [2018-11-06 19:51:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:13,310 INFO L480 AbstractCegarLoop]: Abstraction has 1467 states and 1681 transitions. [2018-11-06 19:51:13,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1681 transitions. [2018-11-06 19:51:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-06 19:51:13,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:13,316 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:13,316 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:13,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:13,317 INFO L82 PathProgramCache]: Analyzing trace with hash -187903462, now seen corresponding path program 1 times [2018-11-06 19:51:13,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:13,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:13,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:13,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:13,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:13,742 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:51:13,954 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 19:51:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-06 19:51:14,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:51:14,036 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:51:14,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:14,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:51:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-06 19:51:14,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:51:14,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2018-11-06 19:51:14,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:51:14,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:51:14,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:51:14,367 INFO L87 Difference]: Start difference. First operand 1467 states and 1681 transitions. Second operand 7 states. [2018-11-06 19:51:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:18,054 INFO L93 Difference]: Finished difference Result 3532 states and 4028 transitions. [2018-11-06 19:51:18,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:51:18,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 251 [2018-11-06 19:51:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:18,065 INFO L225 Difference]: With dead ends: 3532 [2018-11-06 19:51:18,065 INFO L226 Difference]: Without dead ends: 1926 [2018-11-06 19:51:18,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:51:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2018-11-06 19:51:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1467. [2018-11-06 19:51:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2018-11-06 19:51:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1669 transitions. [2018-11-06 19:51:18,103 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1669 transitions. Word has length 251 [2018-11-06 19:51:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:18,103 INFO L480 AbstractCegarLoop]: Abstraction has 1467 states and 1669 transitions. [2018-11-06 19:51:18,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:51:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1669 transitions. [2018-11-06 19:51:18,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-06 19:51:18,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:18,110 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:18,110 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:18,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1891239239, now seen corresponding path program 1 times [2018-11-06 19:51:18,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:18,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:18,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:18,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:18,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:18,388 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:51:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-06 19:51:18,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:18,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:18,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:18,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:18,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:18,521 INFO L87 Difference]: Start difference. First operand 1467 states and 1669 transitions. Second operand 4 states. [2018-11-06 19:51:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:22,748 INFO L93 Difference]: Finished difference Result 4064 states and 4706 transitions. [2018-11-06 19:51:22,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:22,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 272 [2018-11-06 19:51:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:22,760 INFO L225 Difference]: With dead ends: 4064 [2018-11-06 19:51:22,760 INFO L226 Difference]: Without dead ends: 2599 [2018-11-06 19:51:22,763 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2018-11-06 19:51:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2595. [2018-11-06 19:51:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2018-11-06 19:51:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 2919 transitions. [2018-11-06 19:51:22,810 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 2919 transitions. Word has length 272 [2018-11-06 19:51:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:22,811 INFO L480 AbstractCegarLoop]: Abstraction has 2595 states and 2919 transitions. [2018-11-06 19:51:22,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 2919 transitions. [2018-11-06 19:51:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-06 19:51:22,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:22,819 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:22,820 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:22,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:22,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1635104655, now seen corresponding path program 1 times [2018-11-06 19:51:22,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:22,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:22,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:22,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:23,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:23,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:51:23,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:51:23,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:51:23,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:51:23,209 INFO L87 Difference]: Start difference. First operand 2595 states and 2919 transitions. Second operand 5 states. [2018-11-06 19:51:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:24,750 INFO L93 Difference]: Finished difference Result 6453 states and 7190 transitions. [2018-11-06 19:51:24,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:51:24,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 295 [2018-11-06 19:51:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:24,766 INFO L225 Difference]: With dead ends: 6453 [2018-11-06 19:51:24,766 INFO L226 Difference]: Without dead ends: 3432 [2018-11-06 19:51:24,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:51:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2018-11-06 19:51:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3428. [2018-11-06 19:51:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3428 states. [2018-11-06 19:51:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3428 states to 3428 states and 3650 transitions. [2018-11-06 19:51:24,830 INFO L78 Accepts]: Start accepts. Automaton has 3428 states and 3650 transitions. Word has length 295 [2018-11-06 19:51:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:24,831 INFO L480 AbstractCegarLoop]: Abstraction has 3428 states and 3650 transitions. [2018-11-06 19:51:24,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:51:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3428 states and 3650 transitions. [2018-11-06 19:51:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-06 19:51:24,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:24,842 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:24,842 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:24,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:24,843 INFO L82 PathProgramCache]: Analyzing trace with hash 905059674, now seen corresponding path program 1 times [2018-11-06 19:51:24,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:24,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:24,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-06 19:51:25,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:25,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:25,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:25,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:25,106 INFO L87 Difference]: Start difference. First operand 3428 states and 3650 transitions. Second operand 3 states. [2018-11-06 19:51:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:26,129 INFO L93 Difference]: Finished difference Result 6712 states and 7145 transitions. [2018-11-06 19:51:26,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:26,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2018-11-06 19:51:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:26,141 INFO L225 Difference]: With dead ends: 6712 [2018-11-06 19:51:26,141 INFO L226 Difference]: Without dead ends: 3286 [2018-11-06 19:51:26,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2018-11-06 19:51:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 3286. [2018-11-06 19:51:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3286 states. [2018-11-06 19:51:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 3465 transitions. [2018-11-06 19:51:26,198 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 3465 transitions. Word has length 324 [2018-11-06 19:51:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:26,198 INFO L480 AbstractCegarLoop]: Abstraction has 3286 states and 3465 transitions. [2018-11-06 19:51:26,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 3465 transitions. [2018-11-06 19:51:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-06 19:51:26,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:26,205 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:26,205 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:26,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1194461262, now seen corresponding path program 1 times [2018-11-06 19:51:26,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:26,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:26,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-06 19:51:26,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:26,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:26,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:26,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:26,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:26,379 INFO L87 Difference]: Start difference. First operand 3286 states and 3465 transitions. Second operand 3 states. [2018-11-06 19:51:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:26,913 INFO L93 Difference]: Finished difference Result 6569 states and 6927 transitions. [2018-11-06 19:51:26,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:26,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-06 19:51:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:26,921 INFO L225 Difference]: With dead ends: 6569 [2018-11-06 19:51:26,921 INFO L226 Difference]: Without dead ends: 2428 [2018-11-06 19:51:26,925 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2018-11-06 19:51:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2428. [2018-11-06 19:51:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-11-06 19:51:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 2547 transitions. [2018-11-06 19:51:26,966 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 2547 transitions. Word has length 330 [2018-11-06 19:51:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:26,966 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 2547 transitions. [2018-11-06 19:51:26,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2547 transitions. [2018-11-06 19:51:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-06 19:51:26,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:26,972 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:26,972 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:26,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:26,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1953683114, now seen corresponding path program 1 times [2018-11-06 19:51:26,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:26,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:26,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:26,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-06 19:51:27,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:27,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:51:27,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:51:27,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:51:27,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:51:27,312 INFO L87 Difference]: Start difference. First operand 2428 states and 2547 transitions. Second operand 5 states. [2018-11-06 19:51:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:28,262 INFO L93 Difference]: Finished difference Result 4857 states and 5093 transitions. [2018-11-06 19:51:28,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:28,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 348 [2018-11-06 19:51:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:28,271 INFO L225 Difference]: With dead ends: 4857 [2018-11-06 19:51:28,271 INFO L226 Difference]: Without dead ends: 2431 [2018-11-06 19:51:28,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:51:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2018-11-06 19:51:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2429. [2018-11-06 19:51:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2018-11-06 19:51:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 2528 transitions. [2018-11-06 19:51:28,312 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 2528 transitions. Word has length 348 [2018-11-06 19:51:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:28,312 INFO L480 AbstractCegarLoop]: Abstraction has 2429 states and 2528 transitions. [2018-11-06 19:51:28,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:51:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 2528 transitions. [2018-11-06 19:51:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-11-06 19:51:28,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:28,318 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:28,318 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:28,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1636748220, now seen corresponding path program 1 times [2018-11-06 19:51:28,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:28,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:28,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:28,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:28,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-06 19:51:28,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:28,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:28,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:28,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:28,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:28,675 INFO L87 Difference]: Start difference. First operand 2429 states and 2528 transitions. Second operand 4 states. [2018-11-06 19:51:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:29,289 INFO L93 Difference]: Finished difference Result 3421 states and 3541 transitions. [2018-11-06 19:51:29,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:29,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2018-11-06 19:51:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:29,290 INFO L225 Difference]: With dead ends: 3421 [2018-11-06 19:51:29,291 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:51:29,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:51:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:51:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:51:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:51:29,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 373 [2018-11-06 19:51:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:29,295 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:51:29,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:51:29,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:51:29,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:51:29,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:51:29,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:51:29,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:51:29,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:51:30,140 WARN L179 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2018-11-06 19:51:30,533 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2018-11-06 19:51:30,536 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,536 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,536 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,536 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-06 19:51:30,536 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-06 19:51:30,537 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-06 19:51:30,537 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-06 19:51:30,537 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-06 19:51:30,537 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-06 19:51:30,537 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-06 19:51:30,537 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,537 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,537 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,537 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-06 19:51:30,538 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-06 19:51:30,538 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-06 19:51:30,538 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-06 19:51:30,538 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-06 19:51:30,538 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-06 19:51:30,538 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-06 19:51:30,538 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,538 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,538 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,539 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-06 19:51:30,539 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-06 19:51:30,539 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-06 19:51:30,539 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-06 19:51:30,539 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-06 19:51:30,539 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,539 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,539 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,539 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-06 19:51:30,540 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-06 19:51:30,540 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-06 19:51:30,540 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-06 19:51:30,540 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-06 19:51:30,540 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-06 19:51:30,540 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-06 19:51:30,540 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-06 19:51:30,540 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,541 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,541 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,541 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-06 19:51:30,541 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-06 19:51:30,541 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-06 19:51:30,541 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-06 19:51:30,541 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-06 19:51:30,541 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-06 19:51:30,541 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-06 19:51:30,542 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-06 19:51:30,543 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-06 19:51:30,544 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-06 19:51:30,545 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,545 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,545 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,545 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-06 19:51:30,545 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-06 19:51:30,545 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-06 19:51:30,545 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-06 19:51:30,545 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-06 19:51:30,545 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-06 19:51:30,546 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-06 19:51:30,547 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-06 19:51:30,548 INFO L421 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse2 (= ~a11~0 1)) (.cse6 (= ~a28~0 7)) (.cse8 (not (= ~a17~0 9))) (.cse0 (= ~a17~0 8)) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a28~0 10)) (.cse4 (= ~a25~0 1)) (.cse7 (not .cse3))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (not .cse2) (not .cse5)) (and (<= ~a17~0 7) .cse6 .cse4 .cse2) (and (or (= ULTIMATE.start_calculate_output_~input 1) (= 4 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 5)) .cse5 .cse0 .cse3 .cse1) (and .cse0 .cse3 .cse6 .cse1) (and .cse5 .cse2 .cse4) (and (= ~a28~0 9) .cse0 .cse3 .cse1) (and (= ~a28~0 8) (<= ~a25~0 0) .cse7 .cse8) (and .cse2 .cse7) (and (not .cse4) (and .cse7 .cse6) .cse8) (and .cse5 .cse0 .cse3 .cse1 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse5 .cse4 .cse7)))) [2018-11-06 19:51:30,548 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,548 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,548 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-06 19:51:30,548 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L428 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-06 19:51:30,549 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-06 19:51:30,550 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,551 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse2 (= ~a11~0 1)) (.cse6 (= ~a28~0 7)) (.cse8 (not (= ~a17~0 9))) (.cse0 (= ~a17~0 8)) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a28~0 10)) (.cse4 (= ~a25~0 1)) (.cse7 (not .cse3))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (not .cse2) (not .cse5)) (and (<= ~a17~0 7) .cse6 .cse4 .cse2) (and (or (= ULTIMATE.start_calculate_output_~input 1) (= 4 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 5)) .cse5 .cse0 .cse3 .cse1) (and .cse0 .cse3 .cse6 .cse1) (and .cse5 .cse2 .cse4) (and (= ~a28~0 9) .cse0 .cse3 .cse1) (and (= ~a28~0 8) (<= ~a25~0 0) .cse7 .cse8) (and .cse2 .cse7) (and (not .cse4) (and .cse7 .cse6) .cse8) (and .cse5 .cse0 .cse3 .cse1 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse5 .cse4 .cse7)))) [2018-11-06 19:51:30,551 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,551 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-06 19:51:30,551 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-06 19:51:30,551 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-06 19:51:30,551 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-06 19:51:30,551 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-06 19:51:30,551 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,551 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,551 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-06 19:51:30,552 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-06 19:51:30,553 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-06 19:51:30,554 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-06 19:51:30,555 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-06 19:51:30,556 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-06 19:51:30,556 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-06 19:51:30,556 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,556 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,556 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:30,556 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-06 19:51:30,556 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-06 19:51:30,556 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-06 19:51:30,556 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-06 19:51:30,557 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-06 19:51:30,557 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-06 19:51:30,557 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-06 19:51:30,557 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-06 19:51:30,557 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-06 19:51:30,557 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-06 19:51:30,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:51:30 BoogieIcfgContainer [2018-11-06 19:51:30,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:51:30,581 INFO L168 Benchmark]: Toolchain (without parser) took 34452.60 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 143.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:30,583 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:51:30,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:30,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 186.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.3 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:30,585 INFO L168 Benchmark]: Boogie Preprocessor took 74.97 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:51:30,586 INFO L168 Benchmark]: RCFGBuilder took 3173.55 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: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:30,587 INFO L168 Benchmark]: TraceAbstraction took 30294.71 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 414.7 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -344.1 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:30,592 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.23 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 717.06 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 186.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.3 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.97 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 3173.55 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: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30294.71 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 414.7 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -344.1 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((a17 == 8 && a21 == 1) && a11 == 1) || (((a19 == 1 && a25 == 1) && !(a11 == 1)) && !(a28 == 10))) || (((a17 <= 7 && a28 == 7) && a25 == 1) && a11 == 1)) || ((((((input == 1 || 4 == input) || input == 5) && a28 == 10) && a17 == 8) && a19 == 1) && a21 == 1)) || (((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1)) || ((a28 == 10 && a11 == 1) && a25 == 1)) || (((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1)) || (((a28 == 8 && a25 <= 0) && !(a19 == 1)) && !(a17 == 9))) || (a11 == 1 && !(a19 == 1))) || ((!(a25 == 1) && !(a19 == 1) && a28 == 7) && !(a17 == 9))) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && (3 == input || 6 == input))) || ((a28 == 10 && a25 == 1) && !(a19 == 1)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((a17 == 8 && a21 == 1) && a11 == 1) || (((a19 == 1 && a25 == 1) && !(a11 == 1)) && !(a28 == 10))) || (((a17 <= 7 && a28 == 7) && a25 == 1) && a11 == 1)) || ((((((input == 1 || 4 == input) || input == 5) && a28 == 10) && a17 == 8) && a19 == 1) && a21 == 1)) || (((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1)) || ((a28 == 10 && a11 == 1) && a25 == 1)) || (((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1)) || (((a28 == 8 && a25 <= 0) && !(a19 == 1)) && !(a17 == 9))) || (a11 == 1 && !(a19 == 1))) || ((!(a25 == 1) && !(a19 == 1) && a28 == 7) && !(a17 == 9))) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && (3 == input || 6 == input))) || ((a28 == 10 && a25 == 1) && !(a19 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 228 locations, 1 error locations. SAFE Result, 30.1s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 23.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1658 SDtfs, 3650 SDslu, 734 SDs, 0 SdLazy, 7197 SolverSat, 1455 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3428occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 934 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 62 NumberOfFragments, 339 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1072 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 524 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3139 NumberOfCodeBlocks, 3139 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3127 ConstructedInterpolants, 0 QuantifiedInterpolants, 1944084 SizeOfPredicates, 6 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2714 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...