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/Problem15_label44_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:33:08,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:33:08,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:33:08,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:33:08,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:33:08,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:33:08,603 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:33:08,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:33:08,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:33:08,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:33:08,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:33:08,608 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:33:08,609 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:33:08,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:33:08,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:33:08,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:33:08,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:33:08,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:33:08,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:33:08,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:33:08,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:33:08,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:33:08,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:33:08,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:33:08,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:33:08,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:33:08,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:33:08,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:33:08,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:33:08,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:33:08,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:33:08,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:33:08,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:33:08,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:33:08,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:33:08,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:33:08,634 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 21:33:08,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:33:08,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:33:08,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:33:08,660 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:33:08,661 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:33:08,661 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:33:08,661 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:33:08,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:33:08,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:33:08,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:33:08,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:33:08,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:33:08,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:33:08,662 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:33:08,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:33:08,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:33:08,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:33:08,663 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:33:08,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:33:08,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:33:08,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:33:08,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:33:08,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:33:08,664 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:33:08,665 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:33:08,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:33:08,665 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:33:08,665 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:33:08,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:33:08,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:33:08,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:33:08,737 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:33:08,738 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:33:08,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label44_true-unreach-call.c [2018-11-06 21:33:08,811 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f5f6a73/14d53759c8cd41c1b84c216d5f97087c/FLAG5f48d1236 [2018-11-06 21:33:09,480 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:33:09,481 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label44_true-unreach-call.c [2018-11-06 21:33:09,504 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f5f6a73/14d53759c8cd41c1b84c216d5f97087c/FLAG5f48d1236 [2018-11-06 21:33:09,523 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f5f6a73/14d53759c8cd41c1b84c216d5f97087c [2018-11-06 21:33:09,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:33:09,539 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:33:09,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:33:09,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:33:09,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:33:09,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:33:09" (1/1) ... [2018-11-06 21:33:09,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c306b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:09, skipping insertion in model container [2018-11-06 21:33:09,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:33:09" (1/1) ... [2018-11-06 21:33:09,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:33:09,650 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:33:10,491 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:33:10,496 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:33:10,786 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:33:10,809 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:33:10,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10 WrapperNode [2018-11-06 21:33:10,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:33:10,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:33:10,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:33:10,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:33:10,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (1/1) ... [2018-11-06 21:33:11,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (1/1) ... [2018-11-06 21:33:11,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:33:11,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:33:11,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:33:11,227 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:33:11,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (1/1) ... [2018-11-06 21:33:11,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (1/1) ... [2018-11-06 21:33:11,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (1/1) ... [2018-11-06 21:33:11,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (1/1) ... [2018-11-06 21:33:11,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (1/1) ... [2018-11-06 21:33:11,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (1/1) ... [2018-11-06 21:33:11,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (1/1) ... [2018-11-06 21:33:11,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:33:11,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:33:11,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:33:11,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:33:11,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (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 21:33:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:33:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:33:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:33:18,865 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:33:18,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:33:18 BoogieIcfgContainer [2018-11-06 21:33:18,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:33:18,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:33:18,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:33:18,871 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:33:18,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:33:09" (1/3) ... [2018-11-06 21:33:18,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489414e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:33:18, skipping insertion in model container [2018-11-06 21:33:18,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:33:10" (2/3) ... [2018-11-06 21:33:18,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489414e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:33:18, skipping insertion in model container [2018-11-06 21:33:18,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:33:18" (3/3) ... [2018-11-06 21:33:18,875 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label44_true-unreach-call.c [2018-11-06 21:33:18,886 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:33:18,897 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:33:18,916 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:33:18,956 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:33:18,957 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:33:18,957 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:33:18,958 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:33:18,958 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:33:18,958 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:33:18,958 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:33:18,958 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:33:18,958 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:33:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-11-06 21:33:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-06 21:33:18,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:19,001 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] [2018-11-06 21:33:19,003 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:19,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -757100326, now seen corresponding path program 1 times [2018-11-06 21:33:19,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:19,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:19,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:19,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:19,466 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 21:33:19,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:33:19,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:33:19,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:33:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:33:19,496 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-11-06 21:33:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:25,838 INFO L93 Difference]: Finished difference Result 1461 states and 2710 transitions. [2018-11-06 21:33:25,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:33:25,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-06 21:33:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:25,869 INFO L225 Difference]: With dead ends: 1461 [2018-11-06 21:33:25,869 INFO L226 Difference]: Without dead ends: 1029 [2018-11-06 21:33:25,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:33:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-11-06 21:33:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 724. [2018-11-06 21:33:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-06 21:33:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1102 transitions. [2018-11-06 21:33:25,983 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1102 transitions. Word has length 67 [2018-11-06 21:33:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:25,984 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1102 transitions. [2018-11-06 21:33:25,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:33:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1102 transitions. [2018-11-06 21:33:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-06 21:33:25,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:25,990 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:33:25,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:25,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1784675650, now seen corresponding path program 1 times [2018-11-06 21:33:25,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:25,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:25,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:25,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:25,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:26,702 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 9 [2018-11-06 21:33:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:33:26,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:26,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:33:26,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:33:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:33:26,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:33:26,752 INFO L87 Difference]: Start difference. First operand 724 states and 1102 transitions. Second operand 5 states. [2018-11-06 21:33:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:36,332 INFO L93 Difference]: Finished difference Result 2371 states and 3547 transitions. [2018-11-06 21:33:36,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:33:36,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-11-06 21:33:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:36,342 INFO L225 Difference]: With dead ends: 2371 [2018-11-06 21:33:36,343 INFO L226 Difference]: Without dead ends: 1649 [2018-11-06 21:33:36,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:33:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2018-11-06 21:33:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1341. [2018-11-06 21:33:36,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-11-06 21:33:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1885 transitions. [2018-11-06 21:33:36,389 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1885 transitions. Word has length 133 [2018-11-06 21:33:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:36,390 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 1885 transitions. [2018-11-06 21:33:36,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:33:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1885 transitions. [2018-11-06 21:33:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-06 21:33:36,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:36,395 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:33:36,395 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:36,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:36,396 INFO L82 PathProgramCache]: Analyzing trace with hash 601643536, now seen corresponding path program 1 times [2018-11-06 21:33:36,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:36,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:36,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:33:36,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:36,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:33:36,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:33:36,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:33:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:33:36,724 INFO L87 Difference]: Start difference. First operand 1341 states and 1885 transitions. Second operand 4 states. [2018-11-06 21:33:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:40,909 INFO L93 Difference]: Finished difference Result 4794 states and 6886 transitions. [2018-11-06 21:33:40,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:33:40,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-11-06 21:33:40,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:40,928 INFO L225 Difference]: With dead ends: 4794 [2018-11-06 21:33:40,928 INFO L226 Difference]: Without dead ends: 3455 [2018-11-06 21:33:40,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:33:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2018-11-06 21:33:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 3450. [2018-11-06 21:33:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3450 states. [2018-11-06 21:33:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4522 transitions. [2018-11-06 21:33:41,001 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4522 transitions. Word has length 138 [2018-11-06 21:33:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:41,001 INFO L480 AbstractCegarLoop]: Abstraction has 3450 states and 4522 transitions. [2018-11-06 21:33:41,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:33:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4522 transitions. [2018-11-06 21:33:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-06 21:33:41,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:41,011 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-11-06 21:33:41,011 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:41,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash -581278863, now seen corresponding path program 1 times [2018-11-06 21:33:41,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:41,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:41,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:41,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:41,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 129 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-06 21:33:41,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:33:41,534 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 21:33:41,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:41,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:33:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:33:41,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:33:41,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:33:41,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:33:41,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:33:41,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:33:41,812 INFO L87 Difference]: Start difference. First operand 3450 states and 4522 transitions. Second operand 4 states. [2018-11-06 21:33:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:46,804 INFO L93 Difference]: Finished difference Result 11766 states and 15872 transitions. [2018-11-06 21:33:46,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:33:46,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2018-11-06 21:33:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:46,849 INFO L225 Difference]: With dead ends: 11766 [2018-11-06 21:33:46,849 INFO L226 Difference]: Without dead ends: 8318 [2018-11-06 21:33:46,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:33:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8318 states. [2018-11-06 21:33:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8318 to 5251. [2018-11-06 21:33:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5251 states. [2018-11-06 21:33:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5251 states to 5251 states and 6650 transitions. [2018-11-06 21:33:46,968 INFO L78 Accepts]: Start accepts. Automaton has 5251 states and 6650 transitions. Word has length 235 [2018-11-06 21:33:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:46,969 INFO L480 AbstractCegarLoop]: Abstraction has 5251 states and 6650 transitions. [2018-11-06 21:33:46,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:33:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5251 states and 6650 transitions. [2018-11-06 21:33:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-06 21:33:46,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:46,977 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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 21:33:46,978 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:46,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash 201292207, now seen corresponding path program 1 times [2018-11-06 21:33:46,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:46,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:46,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-06 21:33:47,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:47,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:33:47,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:33:47,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:33:47,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:33:47,518 INFO L87 Difference]: Start difference. First operand 5251 states and 6650 transitions. Second operand 5 states. [2018-11-06 21:33:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:51,458 INFO L93 Difference]: Finished difference Result 11403 states and 14307 transitions. [2018-11-06 21:33:51,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:33:51,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 341 [2018-11-06 21:33:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:51,486 INFO L225 Difference]: With dead ends: 11403 [2018-11-06 21:33:51,486 INFO L226 Difference]: Without dead ends: 6154 [2018-11-06 21:33:51,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 21:33:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2018-11-06 21:33:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 5851. [2018-11-06 21:33:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5851 states. [2018-11-06 21:33:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5851 states to 5851 states and 7280 transitions. [2018-11-06 21:33:51,601 INFO L78 Accepts]: Start accepts. Automaton has 5851 states and 7280 transitions. Word has length 341 [2018-11-06 21:33:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:51,602 INFO L480 AbstractCegarLoop]: Abstraction has 5851 states and 7280 transitions. [2018-11-06 21:33:51,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:33:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5851 states and 7280 transitions. [2018-11-06 21:33:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-11-06 21:33:51,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:51,613 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:51,613 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:51,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -153676127, now seen corresponding path program 1 times [2018-11-06 21:33:51,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:51,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:51,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-06 21:33:52,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:52,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:33:52,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:33:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:33:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:33:52,322 INFO L87 Difference]: Start difference. First operand 5851 states and 7280 transitions. Second operand 4 states. [2018-11-06 21:33:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:56,010 INFO L93 Difference]: Finished difference Result 15010 states and 18958 transitions. [2018-11-06 21:33:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:33:56,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 415 [2018-11-06 21:33:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:56,049 INFO L225 Difference]: With dead ends: 15010 [2018-11-06 21:33:56,049 INFO L226 Difference]: Without dead ends: 9161 [2018-11-06 21:33:56,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 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 21:33:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9161 states. [2018-11-06 21:33:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9161 to 8856. [2018-11-06 21:33:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8856 states. [2018-11-06 21:33:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8856 states to 8856 states and 10773 transitions. [2018-11-06 21:33:56,223 INFO L78 Accepts]: Start accepts. Automaton has 8856 states and 10773 transitions. Word has length 415 [2018-11-06 21:33:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:56,224 INFO L480 AbstractCegarLoop]: Abstraction has 8856 states and 10773 transitions. [2018-11-06 21:33:56,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:33:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 8856 states and 10773 transitions. [2018-11-06 21:33:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-11-06 21:33:56,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:56,237 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:56,238 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:56,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:56,238 INFO L82 PathProgramCache]: Analyzing trace with hash 222581867, now seen corresponding path program 1 times [2018-11-06 21:33:56,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:56,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:56,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:56,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:56,839 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:33:57,371 WARN L179 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-11-06 21:33:58,078 WARN L179 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2018-11-06 21:33:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 139 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:33:58,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:33:58,485 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:33:58,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:58,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:33:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:33:58,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:33:58,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-11-06 21:33:58,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:33:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:33:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:33:58,899 INFO L87 Difference]: Start difference. First operand 8856 states and 10773 transitions. Second operand 10 states. [2018-11-06 21:34:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:09,151 INFO L93 Difference]: Finished difference Result 18430 states and 22317 transitions. [2018-11-06 21:34:09,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:34:09,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 420 [2018-11-06 21:34:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:09,178 INFO L225 Difference]: With dead ends: 18430 [2018-11-06 21:34:09,178 INFO L226 Difference]: Without dead ends: 9576 [2018-11-06 21:34:09,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 424 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:34:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9576 states. [2018-11-06 21:34:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9576 to 9155. [2018-11-06 21:34:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9155 states. [2018-11-06 21:34:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9155 states to 9155 states and 10600 transitions. [2018-11-06 21:34:09,446 INFO L78 Accepts]: Start accepts. Automaton has 9155 states and 10600 transitions. Word has length 420 [2018-11-06 21:34:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:09,447 INFO L480 AbstractCegarLoop]: Abstraction has 9155 states and 10600 transitions. [2018-11-06 21:34:09,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:34:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9155 states and 10600 transitions. [2018-11-06 21:34:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-11-06 21:34:09,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:09,458 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, 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, 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] [2018-11-06 21:34:09,458 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:09,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1115027024, now seen corresponding path program 1 times [2018-11-06 21:34:09,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:09,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:09,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:09,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:09,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-06 21:34:09,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:09,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:34:09,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:34:09,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:34:09,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:09,905 INFO L87 Difference]: Start difference. First operand 9155 states and 10600 transitions. Second operand 4 states. [2018-11-06 21:34:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:13,609 INFO L93 Difference]: Finished difference Result 18308 states and 21200 transitions. [2018-11-06 21:34:13,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:34:13,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 439 [2018-11-06 21:34:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:13,628 INFO L225 Difference]: With dead ends: 18308 [2018-11-06 21:34:13,628 INFO L226 Difference]: Without dead ends: 9155 [2018-11-06 21:34:13,638 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 21:34:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9155 states. [2018-11-06 21:34:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9155 to 9153. [2018-11-06 21:34:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9153 states. [2018-11-06 21:34:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9153 states to 9153 states and 10202 transitions. [2018-11-06 21:34:13,760 INFO L78 Accepts]: Start accepts. Automaton has 9153 states and 10202 transitions. Word has length 439 [2018-11-06 21:34:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:13,761 INFO L480 AbstractCegarLoop]: Abstraction has 9153 states and 10202 transitions. [2018-11-06 21:34:13,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:34:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9153 states and 10202 transitions. [2018-11-06 21:34:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-11-06 21:34:13,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:13,780 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:13,781 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:13,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash -33127077, now seen corresponding path program 1 times [2018-11-06 21:34:13,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:13,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:13,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:13,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:13,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-06 21:34:14,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:14,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:14,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:14,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:14,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:14,188 INFO L87 Difference]: Start difference. First operand 9153 states and 10202 transitions. Second operand 3 states. [2018-11-06 21:34:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:16,275 INFO L93 Difference]: Finished difference Result 20703 states and 23376 transitions. [2018-11-06 21:34:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:16,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 534 [2018-11-06 21:34:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:16,298 INFO L225 Difference]: With dead ends: 20703 [2018-11-06 21:34:16,298 INFO L226 Difference]: Without dead ends: 11552 [2018-11-06 21:34:16,311 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 21:34:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11552 states. [2018-11-06 21:34:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11552 to 11552. [2018-11-06 21:34:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11552 states. [2018-11-06 21:34:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11552 states to 11552 states and 12933 transitions. [2018-11-06 21:34:16,555 INFO L78 Accepts]: Start accepts. Automaton has 11552 states and 12933 transitions. Word has length 534 [2018-11-06 21:34:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:16,556 INFO L480 AbstractCegarLoop]: Abstraction has 11552 states and 12933 transitions. [2018-11-06 21:34:16,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 11552 states and 12933 transitions. [2018-11-06 21:34:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2018-11-06 21:34:16,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:16,569 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-11-06 21:34:16,570 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:16,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:16,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1565305326, now seen corresponding path program 1 times [2018-11-06 21:34:16,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:16,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:16,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:16,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:16,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:16,993 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:34:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 666 proven. 4 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-06 21:34:17,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:34:17,812 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:34:17,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:17,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:34:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 631 proven. 39 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-06 21:34:18,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:34:18,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-06 21:34:18,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:34:18,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:34:18,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:34:18,897 INFO L87 Difference]: Start difference. First operand 11552 states and 12933 transitions. Second operand 9 states. [2018-11-06 21:34:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:27,336 INFO L93 Difference]: Finished difference Result 29271 states and 32717 transitions. [2018-11-06 21:34:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:34:27,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 626 [2018-11-06 21:34:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:27,360 INFO L225 Difference]: With dead ends: 29271 [2018-11-06 21:34:27,360 INFO L226 Difference]: Without dead ends: 11802 [2018-11-06 21:34:27,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 623 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:34:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2018-11-06 21:34:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 8201. [2018-11-06 21:34:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8201 states. [2018-11-06 21:34:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 8654 transitions. [2018-11-06 21:34:27,520 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 8654 transitions. Word has length 626 [2018-11-06 21:34:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:27,521 INFO L480 AbstractCegarLoop]: Abstraction has 8201 states and 8654 transitions. [2018-11-06 21:34:27,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:34:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 8654 transitions. [2018-11-06 21:34:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2018-11-06 21:34:27,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:27,532 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:27,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:27,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:27,533 INFO L82 PathProgramCache]: Analyzing trace with hash -644480128, now seen corresponding path program 1 times [2018-11-06 21:34:27,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:27,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:27,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:27,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:27,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2018-11-06 21:34:28,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:28,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:28,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:28,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:28,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:28,155 INFO L87 Difference]: Start difference. First operand 8201 states and 8654 transitions. Second operand 3 states. [2018-11-06 21:34:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:29,599 INFO L93 Difference]: Finished difference Result 16398 states and 17304 transitions. [2018-11-06 21:34:29,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:29,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 668 [2018-11-06 21:34:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:29,615 INFO L225 Difference]: With dead ends: 16398 [2018-11-06 21:34:29,615 INFO L226 Difference]: Without dead ends: 8199 [2018-11-06 21:34:29,621 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 21:34:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2018-11-06 21:34:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8199. [2018-11-06 21:34:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8199 states. [2018-11-06 21:34:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8199 states to 8199 states and 8650 transitions. [2018-11-06 21:34:29,714 INFO L78 Accepts]: Start accepts. Automaton has 8199 states and 8650 transitions. Word has length 668 [2018-11-06 21:34:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:29,715 INFO L480 AbstractCegarLoop]: Abstraction has 8199 states and 8650 transitions. [2018-11-06 21:34:29,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8199 states and 8650 transitions. [2018-11-06 21:34:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2018-11-06 21:34:29,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:29,729 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:34:29,729 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:29,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:29,729 INFO L82 PathProgramCache]: Analyzing trace with hash -703900703, now seen corresponding path program 1 times [2018-11-06 21:34:29,730 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:29,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:29,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:29,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:29,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-11-06 21:34:30,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:30,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:30,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:30,422 INFO L87 Difference]: Start difference. First operand 8199 states and 8650 transitions. Second operand 3 states. [2018-11-06 21:34:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:31,835 INFO L93 Difference]: Finished difference Result 19402 states and 20476 transitions. [2018-11-06 21:34:31,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:31,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 695 [2018-11-06 21:34:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:31,849 INFO L225 Difference]: With dead ends: 19402 [2018-11-06 21:34:31,849 INFO L226 Difference]: Without dead ends: 10899 [2018-11-06 21:34:31,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10899 states. [2018-11-06 21:34:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10899 to 10292. [2018-11-06 21:34:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10292 states. [2018-11-06 21:34:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10292 states to 10292 states and 10762 transitions. [2018-11-06 21:34:31,976 INFO L78 Accepts]: Start accepts. Automaton has 10292 states and 10762 transitions. Word has length 695 [2018-11-06 21:34:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:31,977 INFO L480 AbstractCegarLoop]: Abstraction has 10292 states and 10762 transitions. [2018-11-06 21:34:31,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 10292 states and 10762 transitions. [2018-11-06 21:34:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2018-11-06 21:34:31,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:31,992 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:34:31,992 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:31,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:31,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1244175928, now seen corresponding path program 1 times [2018-11-06 21:34:31,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:31,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2018-11-06 21:34:32,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:32,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:32,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:32,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:32,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:32,768 INFO L87 Difference]: Start difference. First operand 10292 states and 10762 transitions. Second operand 3 states. [2018-11-06 21:34:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:33,986 INFO L93 Difference]: Finished difference Result 19037 states and 19863 transitions. [2018-11-06 21:34:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:33,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 736 [2018-11-06 21:34:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:33,993 INFO L225 Difference]: With dead ends: 19037 [2018-11-06 21:34:33,993 INFO L226 Difference]: Without dead ends: 8143 [2018-11-06 21:34:34,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:34:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2018-11-06 21:34:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 7243. [2018-11-06 21:34:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7243 states. [2018-11-06 21:34:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7243 states to 7243 states and 7462 transitions. [2018-11-06 21:34:34,082 INFO L78 Accepts]: Start accepts. Automaton has 7243 states and 7462 transitions. Word has length 736 [2018-11-06 21:34:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:34,083 INFO L480 AbstractCegarLoop]: Abstraction has 7243 states and 7462 transitions. [2018-11-06 21:34:34,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 7243 states and 7462 transitions. [2018-11-06 21:34:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2018-11-06 21:34:34,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:34,102 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:34,103 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:34,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1581572301, now seen corresponding path program 1 times [2018-11-06 21:34:34,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:34,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:34,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 897 proven. 0 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2018-11-06 21:34:35,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:35,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:35,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:35,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:35,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:35,182 INFO L87 Difference]: Start difference. First operand 7243 states and 7462 transitions. Second operand 3 states. [2018-11-06 21:34:36,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:36,771 INFO L93 Difference]: Finished difference Result 17184 states and 17722 transitions. [2018-11-06 21:34:36,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:36,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 914 [2018-11-06 21:34:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:36,781 INFO L225 Difference]: With dead ends: 17184 [2018-11-06 21:34:36,781 INFO L226 Difference]: Without dead ends: 10243 [2018-11-06 21:34:36,786 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 21:34:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10243 states. [2018-11-06 21:34:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10243 to 9043. [2018-11-06 21:34:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9043 states. [2018-11-06 21:34:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9043 states to 9043 states and 9281 transitions. [2018-11-06 21:34:36,891 INFO L78 Accepts]: Start accepts. Automaton has 9043 states and 9281 transitions. Word has length 914 [2018-11-06 21:34:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:36,892 INFO L480 AbstractCegarLoop]: Abstraction has 9043 states and 9281 transitions. [2018-11-06 21:34:36,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 9043 states and 9281 transitions. [2018-11-06 21:34:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-11-06 21:34:36,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:36,912 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-06 21:34:36,912 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:36,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1231223931, now seen corresponding path program 1 times [2018-11-06 21:34:36,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:36,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:36,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 845 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2018-11-06 21:34:38,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:38,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:38,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:38,039 INFO L87 Difference]: Start difference. First operand 9043 states and 9281 transitions. Second operand 3 states. [2018-11-06 21:34:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:39,733 INFO L93 Difference]: Finished difference Result 20492 states and 21056 transitions. [2018-11-06 21:34:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:39,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 927 [2018-11-06 21:34:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:39,745 INFO L225 Difference]: With dead ends: 20492 [2018-11-06 21:34:39,745 INFO L226 Difference]: Without dead ends: 11751 [2018-11-06 21:34:39,752 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 21:34:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11751 states. [2018-11-06 21:34:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11751 to 11143. [2018-11-06 21:34:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11143 states. [2018-11-06 21:34:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11143 states to 11143 states and 11437 transitions. [2018-11-06 21:34:39,879 INFO L78 Accepts]: Start accepts. Automaton has 11143 states and 11437 transitions. Word has length 927 [2018-11-06 21:34:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:39,879 INFO L480 AbstractCegarLoop]: Abstraction has 11143 states and 11437 transitions. [2018-11-06 21:34:39,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 11143 states and 11437 transitions. [2018-11-06 21:34:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2018-11-06 21:34:39,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:39,897 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:39,897 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:39,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:39,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1090597005, now seen corresponding path program 1 times [2018-11-06 21:34:39,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:39,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:39,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:39,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:39,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:41,028 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-06 21:34:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 65 proven. 903 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-11-06 21:34:43,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:34:43,029 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:34:43,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:43,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:34:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 65 proven. 903 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-11-06 21:34:45,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:34:45,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-11-06 21:34:45,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:34:45,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:34:45,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:34:45,620 INFO L87 Difference]: Start difference. First operand 11143 states and 11437 transitions. Second operand 6 states. [2018-11-06 21:34:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:49,188 INFO L93 Difference]: Finished difference Result 19266 states and 19800 transitions. [2018-11-06 21:34:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:34:49,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1048 [2018-11-06 21:34:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:49,206 INFO L225 Difference]: With dead ends: 19266 [2018-11-06 21:34:49,206 INFO L226 Difference]: Without dead ends: 19264 [2018-11-06 21:34:49,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1052 GetRequests, 1046 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:34:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19264 states. [2018-11-06 21:34:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19264 to 14150. [2018-11-06 21:34:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2018-11-06 21:34:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 14547 transitions. [2018-11-06 21:34:49,527 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 14547 transitions. Word has length 1048 [2018-11-06 21:34:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:49,528 INFO L480 AbstractCegarLoop]: Abstraction has 14150 states and 14547 transitions. [2018-11-06 21:34:49,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:34:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 14547 transitions. [2018-11-06 21:34:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1215 [2018-11-06 21:34:49,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:49,561 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:34:49,562 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:49,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1019422664, now seen corresponding path program 1 times [2018-11-06 21:34:49,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:49,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:49,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2260 backedges. 1419 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2018-11-06 21:34:50,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:50,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:50,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:50,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:50,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:50,974 INFO L87 Difference]: Start difference. First operand 14150 states and 14547 transitions. Second operand 3 states. [2018-11-06 21:34:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:52,038 INFO L93 Difference]: Finished difference Result 28295 states and 29074 transitions. [2018-11-06 21:34:52,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:52,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1214 [2018-11-06 21:34:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:52,050 INFO L225 Difference]: With dead ends: 28295 [2018-11-06 21:34:52,050 INFO L226 Difference]: Without dead ends: 14447 [2018-11-06 21:34:52,059 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 21:34:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14447 states. [2018-11-06 21:34:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14447 to 13547. [2018-11-06 21:34:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13547 states. [2018-11-06 21:34:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13547 states to 13547 states and 13913 transitions. [2018-11-06 21:34:52,192 INFO L78 Accepts]: Start accepts. Automaton has 13547 states and 13913 transitions. Word has length 1214 [2018-11-06 21:34:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:52,192 INFO L480 AbstractCegarLoop]: Abstraction has 13547 states and 13913 transitions. [2018-11-06 21:34:52,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 13547 states and 13913 transitions. [2018-11-06 21:34:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1272 [2018-11-06 21:34:52,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:52,210 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-11-06 21:34:52,210 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:52,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2134174317, now seen corresponding path program 1 times [2018-11-06 21:34:52,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:52,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:52,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:53,224 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:34:53,568 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 21:34:54,325 WARN L179 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2018-11-06 21:34:54,630 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-11-06 21:34:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2708 backedges. 2049 proven. 273 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-11-06 21:34:56,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:34:56,112 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:34:56,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:56,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:34:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2708 backedges. 2143 proven. 2 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2018-11-06 21:34:57,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:34:57,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2018-11-06 21:34:57,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 21:34:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 21:34:57,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:34:57,890 INFO L87 Difference]: Start difference. First operand 13547 states and 13913 transitions. Second operand 13 states. [2018-11-06 21:35:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:35:02,994 INFO L93 Difference]: Finished difference Result 27334 states and 28073 transitions. [2018-11-06 21:35:02,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-06 21:35:02,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1271 [2018-11-06 21:35:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:35:03,008 INFO L225 Difference]: With dead ends: 27334 [2018-11-06 21:35:03,009 INFO L226 Difference]: Without dead ends: 14089 [2018-11-06 21:35:03,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1323 GetRequests, 1291 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2018-11-06 21:35:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14089 states. [2018-11-06 21:35:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14089 to 13547. [2018-11-06 21:35:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13547 states. [2018-11-06 21:35:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13547 states to 13547 states and 13911 transitions. [2018-11-06 21:35:03,155 INFO L78 Accepts]: Start accepts. Automaton has 13547 states and 13911 transitions. Word has length 1271 [2018-11-06 21:35:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:35:03,156 INFO L480 AbstractCegarLoop]: Abstraction has 13547 states and 13911 transitions. [2018-11-06 21:35:03,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 21:35:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 13547 states and 13911 transitions. [2018-11-06 21:35:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2018-11-06 21:35:03,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:35:03,174 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-11-06 21:35:03,174 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:35:03,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:35:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1177363207, now seen corresponding path program 1 times [2018-11-06 21:35:03,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:35:03,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:35:03,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:03,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:04,527 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 3 [2018-11-06 21:35:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 2160 proven. 153 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2018-11-06 21:35:05,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:35:05,541 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:35:05,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:05,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:35:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 2160 proven. 153 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2018-11-06 21:35:06,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:35:06,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 9 [2018-11-06 21:35:06,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:35:06,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:35:06,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:35:06,975 INFO L87 Difference]: Start difference. First operand 13547 states and 13911 transitions. Second operand 9 states. [2018-11-06 21:35:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:35:12,929 INFO L93 Difference]: Finished difference Result 30466 states and 31298 transitions. [2018-11-06 21:35:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:35:12,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1277 [2018-11-06 21:35:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:35:12,947 INFO L225 Difference]: With dead ends: 30466 [2018-11-06 21:35:12,948 INFO L226 Difference]: Without dead ends: 17221 [2018-11-06 21:35:12,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1301 GetRequests, 1284 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2018-11-06 21:35:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17221 states. [2018-11-06 21:35:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17221 to 14747. [2018-11-06 21:35:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14747 states. [2018-11-06 21:35:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14747 states to 14747 states and 15139 transitions. [2018-11-06 21:35:13,111 INFO L78 Accepts]: Start accepts. Automaton has 14747 states and 15139 transitions. Word has length 1277 [2018-11-06 21:35:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:35:13,112 INFO L480 AbstractCegarLoop]: Abstraction has 14747 states and 15139 transitions. [2018-11-06 21:35:13,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:35:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 14747 states and 15139 transitions. [2018-11-06 21:35:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2018-11-06 21:35:13,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:35:13,135 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:35:13,136 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:35:13,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:35:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1706092370, now seen corresponding path program 1 times [2018-11-06 21:35:13,136 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:35:13,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:35:13,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:13,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:13,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2953 backedges. 1756 proven. 606 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2018-11-06 21:35:15,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:35:15,194 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:35:15,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:15,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:35:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2953 backedges. 1870 proven. 492 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2018-11-06 21:35:16,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:35:16,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-11-06 21:35:16,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:35:16,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:35:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:35:16,895 INFO L87 Difference]: Start difference. First operand 14747 states and 15139 transitions. Second operand 6 states. [2018-11-06 21:35:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:35:20,223 INFO L93 Difference]: Finished difference Result 26175 states and 26871 transitions. [2018-11-06 21:35:20,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:35:20,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1340 [2018-11-06 21:35:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:35:20,249 INFO L225 Difference]: With dead ends: 26175 [2018-11-06 21:35:20,249 INFO L226 Difference]: Without dead ends: 26173 [2018-11-06 21:35:20,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1345 GetRequests, 1339 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:35:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26173 states. [2018-11-06 21:35:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26173 to 18652. [2018-11-06 21:35:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18652 states. [2018-11-06 21:35:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18652 states to 18652 states and 19160 transitions. [2018-11-06 21:35:20,550 INFO L78 Accepts]: Start accepts. Automaton has 18652 states and 19160 transitions. Word has length 1340 [2018-11-06 21:35:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:35:20,551 INFO L480 AbstractCegarLoop]: Abstraction has 18652 states and 19160 transitions. [2018-11-06 21:35:20,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:35:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 18652 states and 19160 transitions. [2018-11-06 21:35:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1639 [2018-11-06 21:35:20,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:35:20,585 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:35:20,585 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:35:20,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:35:20,586 INFO L82 PathProgramCache]: Analyzing trace with hash 78869614, now seen corresponding path program 1 times [2018-11-06 21:35:20,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:35:20,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:35:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:20,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:20,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:21,651 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:35:21,815 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-11-06 21:35:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 3454 proven. 316 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2018-11-06 21:35:24,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:35:24,888 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:35:24,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:25,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:35:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 3480 proven. 0 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2018-11-06 21:35:27,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:35:27,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2018-11-06 21:35:27,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:35:27,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:35:27,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:35:27,977 INFO L87 Difference]: Start difference. First operand 18652 states and 19160 transitions. Second operand 12 states. [2018-11-06 21:35:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:35:34,535 INFO L93 Difference]: Finished difference Result 36946 states and 37953 transitions. [2018-11-06 21:35:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 21:35:34,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1638 [2018-11-06 21:35:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:35:34,541 INFO L225 Difference]: With dead ends: 36946 [2018-11-06 21:35:34,541 INFO L226 Difference]: Without dead ends: 5788 [2018-11-06 21:35:34,551 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1661 GetRequests, 1642 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-11-06 21:35:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2018-11-06 21:35:34,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5108. [2018-11-06 21:35:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5108 states. [2018-11-06 21:35:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5108 states to 5108 states and 5142 transitions. [2018-11-06 21:35:34,600 INFO L78 Accepts]: Start accepts. Automaton has 5108 states and 5142 transitions. Word has length 1638 [2018-11-06 21:35:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:35:34,601 INFO L480 AbstractCegarLoop]: Abstraction has 5108 states and 5142 transitions. [2018-11-06 21:35:34,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:35:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 5108 states and 5142 transitions. [2018-11-06 21:35:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2136 [2018-11-06 21:35:34,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:35:34,625 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 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] [2018-11-06 21:35:34,625 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:35:34,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:35:34,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1933789568, now seen corresponding path program 1 times [2018-11-06 21:35:34,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:35:34,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:35:34,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:34,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:34,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:35:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:36,141 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:35:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8016 backedges. 5849 proven. 793 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-11-06 21:35:39,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:35:39,859 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:35:39,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:35:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:35:40,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:35:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8016 backedges. 3651 proven. 244 refuted. 0 times theorem prover too weak. 4121 trivial. 0 not checked. [2018-11-06 21:35:45,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:35:45,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-06 21:35:45,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-06 21:35:45,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-06 21:35:45,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-06 21:35:45,658 INFO L87 Difference]: Start difference. First operand 5108 states and 5142 transitions. Second operand 15 states. [2018-11-06 21:35:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:35:56,489 INFO L93 Difference]: Finished difference Result 9966 states and 10035 transitions. [2018-11-06 21:35:56,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-06 21:35:56,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 2135 [2018-11-06 21:35:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:35:56,492 INFO L225 Difference]: With dead ends: 9966 [2018-11-06 21:35:56,492 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:35:56,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2186 GetRequests, 2150 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2018-11-06 21:35:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:35:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:35:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:35:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:35:56,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2135 [2018-11-06 21:35:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:35:56,496 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:35:56,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-06 21:35:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:35:56,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:35:56,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:35:56,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:56,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:56,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:56,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:56,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:56,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:56,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:56,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:57,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:57,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:57,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:57,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:57,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:57,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:57,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:57,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:57,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:58,975 WARN L179 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 777 DAG size of output: 634 [2018-11-06 21:35:59,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:35:59,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,690 WARN L179 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 774 DAG size of output: 640 [2018-11-06 21:36:00,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:00,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:01,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:01,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:01,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:36:01,043 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 431 DAG size of output: 364 [2018-11-06 21:36:08,896 WARN L179 SmtUtils]: Spent 7.85 s on a formula simplification. DAG size of input: 589 DAG size of output: 160 [2018-11-06 21:36:16,585 WARN L179 SmtUtils]: Spent 7.68 s on a formula simplification. DAG size of input: 595 DAG size of output: 162 [2018-11-06 21:36:20,450 WARN L179 SmtUtils]: Spent 3.86 s on a formula simplification. DAG size of input: 352 DAG size of output: 155 [2018-11-06 21:36:20,455 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L102(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L105(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,456 INFO L425 ceAbstractionStarter]: For program point L108(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,457 INFO L425 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,457 INFO L425 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,457 INFO L425 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,457 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,457 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-06 21:36:20,457 INFO L425 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,457 INFO L425 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,457 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,457 INFO L425 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L111(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2018-11-06 21:36:20,458 INFO L425 ceAbstractionStarter]: For program point L114(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,459 INFO L425 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,459 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,459 INFO L425 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,459 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-06 21:36:20,459 INFO L425 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,459 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,459 INFO L425 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,459 INFO L425 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,459 INFO L425 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L117(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,460 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,461 INFO L425 ceAbstractionStarter]: For program point L120(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,461 INFO L425 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,461 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,461 INFO L425 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,461 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-06 21:36:20,461 INFO L425 ceAbstractionStarter]: For program point L123(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,461 INFO L425 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,461 INFO L425 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,461 INFO L425 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,462 INFO L425 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,462 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-06 21:36:20,462 INFO L425 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,462 INFO L425 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2018-11-06 21:36:20,462 INFO L425 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2018-11-06 21:36:20,462 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2018-11-06 21:36:20,462 INFO L425 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2018-11-06 21:36:20,462 INFO L425 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2018-11-06 21:36:20,462 INFO L425 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L126(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,463 INFO L425 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L129(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L132(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,464 INFO L425 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2018-11-06 21:36:20,465 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,466 INFO L425 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,466 INFO L425 ceAbstractionStarter]: For program point L135(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,466 INFO L425 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,466 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 21:36:20,466 INFO L425 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,466 INFO L425 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,466 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,466 INFO L425 ceAbstractionStarter]: For program point L138(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,466 INFO L425 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2018-11-06 21:36:20,467 INFO L425 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2018-11-06 21:36:20,467 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,467 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-06 21:36:20,467 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,467 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2018-11-06 21:36:20,467 INFO L425 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,467 INFO L425 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,467 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L141(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L144(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,468 INFO L425 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,469 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-06 21:36:20,469 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,469 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,469 INFO L425 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,469 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,469 INFO L425 ceAbstractionStarter]: For program point L147(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,469 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 21:36:20,469 INFO L425 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,469 INFO L425 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L150(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,470 INFO L425 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L153(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,471 INFO L425 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L156(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-06 21:36:20,472 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point L159(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point L27(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:36:20,473 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 21:36:20,474 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,474 INFO L425 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,474 INFO L425 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,474 INFO L425 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,474 INFO L425 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,474 INFO L425 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2018-11-06 21:36:20,474 INFO L425 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2018-11-06 21:36:20,474 INFO L425 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2018-11-06 21:36:20,474 INFO L425 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2018-11-06 21:36:20,475 INFO L425 ceAbstractionStarter]: For program point L162(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,475 INFO L425 ceAbstractionStarter]: For program point L30(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,475 INFO L425 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,475 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-06 21:36:20,475 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-06 21:36:20,475 INFO L425 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,475 INFO L425 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,475 INFO L425 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,475 INFO L425 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L165(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L33(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,476 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L168(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L36(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2018-11-06 21:36:20,477 INFO L425 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,478 INFO L425 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,478 INFO L425 ceAbstractionStarter]: For program point L171(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,478 INFO L425 ceAbstractionStarter]: For program point L39(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,479 INFO L421 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse29 (= ~a2~0 3)) (.cse38 (+ ~a4~0 86)) (.cse40 (+ ~a0~0 61))) (let ((.cse37 (< 0 .cse40)) (.cse30 (<= .cse38 0)) (.cse39 (not .cse29))) (let ((.cse33 (and .cse30 .cse39)) (.cse32 (= ~a2~0 2)) (.cse34 (+ ~a29~0 144)) (.cse36 (+ ~a0~0 44)) (.cse10 (<= (+ ~a4~0 42) 0)) (.cse8 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse23 (<= .cse40 0)) (.cse35 (+ ~a29~0 16)) (.cse20 (and .cse30 .cse37 .cse39)) (.cse21 (<= 0 (+ ~a29~0 15))) (.cse26 (< 0 .cse38)) (.cse4 (<= ~a29~0 43)) (.cse28 (not (= 4 ULTIMATE.start_calculate_output_~input)))) (let ((.cse13 (or .cse26 .cse4 .cse28)) (.cse16 (and (and (not (= 4 ~a2~0)) .cse20) .cse21)) (.cse3 (< 0 .cse35)) (.cse25 (or .cse26 .cse4 .cse8 .cse23)) (.cse1 (and .cse10 (and .cse37 .cse29))) (.cse12 (< 43 ~a29~0)) (.cse0 (<= 0 .cse36)) (.cse2 (<= .cse36 0)) (.cse19 (<= (+ ~a29~0 145) 0)) (.cse11 (= ~a2~0 4)) (.cse22 (<= .cse35 0)) (.cse24 (< 0 .cse34)) (.cse18 (< 0 (+ ~a0~0 147))) (.cse17 (<= 0 (+ ~a0~0 592935))) (.cse15 (<= 2722 ~a0~0)) (.cse5 (or (and .cse21 .cse32 .cse33) (and .cse32 .cse20))) (.cse6 (= ~a2~0 1)) (.cse9 (<= (+ ~a0~0 98) 0)) (.cse14 (= ~a2~0 5)) (.cse27 (<= 0 (+ ~a0~0 595423)))) (or (and (and .cse0 .cse1 .cse2) .cse3 .cse4) (and .cse3 .cse5) (let ((.cse7 (+ ~a29~0 127))) (and (and (and (<= (+ ~a4~0 89) 0) .cse6) .cse0) (<= .cse7 0) (<= 0 .cse7) .cse2)) (and .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 (and .cse15 .cse16)) (and .cse9 .cse10 .cse14 .cse17) (and .cse9 .cse10 .cse11 .cse18) (and .cse13 .cse14 (and .cse0 .cse16 .cse2)) (and .cse1 .cse19) (and .cse4 (and .cse20 .cse21 .cse11)) (and .cse22 .cse23 .cse10 .cse6 .cse24 .cse17) (and .cse14 (and .cse16 .cse4)) (and .cse25 .cse15 .cse1) (and .cse10 .cse3 .cse4 (and .cse6 .cse26) .cse27) (and .cse9 .cse10 .cse6 .cse21 (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse17) (and .cse25 (and .cse0 .cse1 .cse2 .cse12)) (and .cse9 .cse10 (or .cse22 .cse28) .cse11 .cse4 .cse17) (and .cse29 .cse30 .cse23) (and .cse5 .cse0 .cse2) (and .cse9 .cse10 .cse29) (or (and .cse20 (<= 4694 ~a0~0) .cse19 .cse11) (and .cse11 (and .cse30 .cse22 .cse24))) (and (exists ((v_~a0~0_832 Int)) (let ((.cse31 (* 9 v_~a0~0_832))) (and (= (mod .cse31 10) 0) (< 0 (+ v_~a0~0_832 61)) (<= (div .cse31 10) (+ ~a0~0 595384))))) (and .cse9 (and .cse21 .cse32))) (and .cse9 .cse18 .cse10 .cse6) (and .cse9 .cse10 .cse32 .cse17) (and .cse15 .cse5) (and .cse9 .cse33) (and (and .cse30 .cse6) (<= .cse34 0)) (and (not (= 2 ~a2~0)) .cse23 .cse33) (and .cse9 .cse10 .cse14 .cse27 (<= 533309 ~a29~0))))))) [2018-11-06 21:36:20,479 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 21:36:20,479 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-06 21:36:20,479 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,479 INFO L425 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,479 INFO L425 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,479 INFO L425 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,479 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,479 INFO L425 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,480 INFO L425 ceAbstractionStarter]: For program point L174(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,480 INFO L425 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2018-11-06 21:36:20,480 INFO L425 ceAbstractionStarter]: For program point L42(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,480 INFO L425 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2018-11-06 21:36:20,480 INFO L428 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2018-11-06 21:36:20,480 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,480 INFO L425 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2018-11-06 21:36:20,480 INFO L425 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2018-11-06 21:36:20,480 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-06 21:36:20,480 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L177(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L45(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2018-11-06 21:36:20,481 INFO L425 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2018-11-06 21:36:20,482 INFO L425 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,482 INFO L425 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,482 INFO L425 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,482 INFO L425 ceAbstractionStarter]: For program point L180(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,482 INFO L425 ceAbstractionStarter]: For program point L48(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,482 INFO L425 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,482 INFO L425 ceAbstractionStarter]: For program point L1766-1(lines 1766 1775) no Hoare annotation was computed. [2018-11-06 21:36:20,483 INFO L421 ceAbstractionStarter]: At program point L1766-3(lines 1766 1775) the Hoare annotation is: (let ((.cse31 (= ~a2~0 3)) (.cse40 (+ ~a4~0 86))) (let ((.cse11 (<= .cse40 0)) (.cse38 (not .cse31)) (.cse39 (+ ~a0~0 61))) (let ((.cse37 (< 0 .cse39)) (.cse2 (= ~a2~0 2)) (.cse41 (and .cse11 .cse38))) (let ((.cse18 (and (not (= 2 ~a2~0)) .cse41)) (.cse35 (+ ~a0~0 44)) (.cse30 (and .cse2 .cse41)) (.cse6 (<= 0 (+ ~a29~0 15))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse12 (+ ~a29~0 144)) (.cse36 (+ ~a29~0 16)) (.cse32 (< 0 .cse40)) (.cse4 (<= ~a29~0 43)) (.cse19 (<= .cse39 0)) (.cse33 (and .cse11 .cse37 .cse38)) (.cse15 (= ~a2~0 4))) (let ((.cse22 (<= 2722 ~a0~0)) (.cse25 (<= (+ ~a29~0 145) 0)) (.cse5 (and .cse33 .cse15)) (.cse24 (or .cse32 .cse4 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse19)) (.cse20 (< 43 ~a29~0)) (.cse14 (<= .cse36 0)) (.cse26 (< 0 .cse12)) (.cse3 (<= 0 (+ ~a0~0 592935))) (.cse23 (and .cse1 (and .cse37 .cse31))) (.cse13 (< 0 (+ ~a0~0 147))) (.cse29 (< 0 .cse36)) (.cse16 (or (and .cse2 .cse33) (and .cse30 .cse6))) (.cse7 (<= 0 .cse35)) (.cse10 (<= .cse35 0)) (.cse17 (= ~a2~0 5)) (.cse21 (and (let ((.cse34 (not (= 4 ~a2~0)))) (or (and .cse33 .cse34) (and .cse18 .cse34))) .cse6)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse28 (<= 0 (+ ~a0~0 595423))) (.cse9 (= ~a2~0 1))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse4 (and .cse5 .cse6)) (let ((.cse8 (+ ~a29~0 127))) (and (<= (+ ~a4~0 89) 0) .cse7 (<= 0 .cse8) .cse9 (<= .cse8 0) .cse10)) (and (and .cse11 .cse9) (<= .cse12 0)) (and .cse0 .cse1 (or .cse13 .cse14 (not (= 4 ULTIMATE.start_calculate_output_~input))) .cse15 .cse3) (and .cse16 .cse7 .cse10) (and (and .cse0 .cse1) .cse17 .cse3) (and .cse0 .cse1 .cse9 .cse6 .cse3) (and .cse18 .cse19) (and .cse0 .cse1 .cse15 .cse20) (and (and .cse21 .cse22) .cse17) (and .cse23 .cse24 .cse22) (and .cse16 .cse22) (and .cse23 .cse25) (or (and .cse25 (and .cse5 (<= 4694 ~a0~0))) (and .cse15 (and .cse11 .cse14 .cse26))) (and .cse24 (and .cse7 .cse23 .cse10 .cse20)) (and (exists ((v_~a0~0_832 Int)) (let ((.cse27 (* 9 v_~a0~0_832))) (and (= (mod .cse27 10) 0) (< 0 (+ v_~a0~0_832 61)) (<= (div .cse27 10) (+ ~a0~0 595384))))) (and .cse0 (and .cse6 .cse2))) (and (and .cse17 (and .cse0 .cse1 .cse28)) (<= 533309 ~a29~0)) (and .cse14 .cse19 .cse1 .cse9 .cse26 .cse3) (and (and (and .cse7 .cse23 .cse10) .cse4) .cse29) (and .cse0 .cse1 .cse9 .cse13) (and .cse0 .cse30) (and .cse31 .cse11 .cse19) (and .cse29 .cse16) (and .cse17 (and .cse21 .cse7 .cse10)) (and .cse17 (and .cse4 .cse21)) (and .cse0 .cse1 .cse31) (and .cse1 .cse6 .cse28 (and .cse9 .cse32 .cse4)))))))) [2018-11-06 21:36:20,483 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,483 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-06 21:36:20,483 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-06 21:36:20,483 INFO L425 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,483 INFO L425 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,483 INFO L425 ceAbstractionStarter]: For program point L183(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L51(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,484 INFO L425 ceAbstractionStarter]: For program point L186(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,485 INFO L425 ceAbstractionStarter]: For program point L54(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,485 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,485 INFO L425 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,485 INFO L425 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,485 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-06 21:36:20,485 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-06 21:36:20,485 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,485 INFO L425 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,485 INFO L425 ceAbstractionStarter]: For program point L189(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L57(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,486 INFO L425 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,487 INFO L425 ceAbstractionStarter]: For program point L192(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,487 INFO L425 ceAbstractionStarter]: For program point L60(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,487 INFO L425 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,487 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-06 21:36:20,487 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-06 21:36:20,487 INFO L425 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,487 INFO L425 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,487 INFO L425 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,487 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L195(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L63(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,488 INFO L425 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L198(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L66(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,489 INFO L425 ceAbstractionStarter]: For program point L201(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,490 INFO L425 ceAbstractionStarter]: For program point L69(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,490 INFO L425 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,490 INFO L421 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse31 (= ~a2~0 3)) (.cse40 (+ ~a4~0 86))) (let ((.cse7 (<= .cse40 0)) (.cse38 (not .cse31)) (.cse39 (+ ~a0~0 61))) (let ((.cse37 (< 0 .cse39)) (.cse2 (= ~a2~0 2)) (.cse41 (and .cse7 .cse38))) (let ((.cse17 (and (not (= 2 ~a2~0)) .cse41)) (.cse35 (+ ~a0~0 44)) (.cse30 (and .cse2 .cse41)) (.cse6 (<= 0 (+ ~a29~0 15))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse9 (+ ~a29~0 144)) (.cse36 (+ ~a29~0 16)) (.cse32 (< 0 .cse40)) (.cse4 (<= ~a29~0 43)) (.cse18 (<= .cse39 0)) (.cse33 (and .cse7 .cse37 .cse38)) (.cse12 (= ~a2~0 4))) (let ((.cse21 (<= 2722 ~a0~0)) (.cse24 (<= (+ ~a29~0 145) 0)) (.cse5 (and .cse33 .cse12)) (.cse23 (or .cse32 .cse4 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse18)) (.cse19 (< 43 ~a29~0)) (.cse11 (<= .cse36 0)) (.cse25 (< 0 .cse9)) (.cse3 (<= 0 (+ ~a0~0 592935))) (.cse22 (and .cse1 (and .cse37 .cse31))) (.cse10 (< 0 (+ ~a0~0 147))) (.cse29 (< 0 .cse36)) (.cse13 (or (and .cse2 .cse33) (and .cse30 .cse6))) (.cse14 (<= 0 .cse35)) (.cse15 (<= .cse35 0)) (.cse16 (= ~a2~0 5)) (.cse20 (and (let ((.cse34 (not (= 4 ~a2~0)))) (or (and .cse33 .cse34) (and .cse17 .cse34))) .cse6)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse28 (<= 0 (+ ~a0~0 595423))) (.cse8 (= ~a2~0 1))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse4 (and .cse5 .cse6)) (and (and .cse7 .cse8) (<= .cse9 0)) (and .cse0 .cse1 (or .cse10 .cse11 (not (= 4 ULTIMATE.start_calculate_output_~input))) .cse12 .cse3) (and .cse13 .cse14 .cse15) (and (and .cse0 .cse1) .cse16 .cse3) (and .cse0 .cse1 .cse8 .cse6 .cse3) (and .cse17 .cse18) (and .cse0 .cse1 .cse12 .cse19) (and (and .cse20 .cse21) .cse16) (and .cse22 .cse23 .cse21) (and .cse13 .cse21) (and .cse22 .cse24) (or (and .cse24 (and .cse5 (<= 4694 ~a0~0))) (and .cse12 (and .cse7 .cse11 .cse25))) (let ((.cse26 (+ ~a29~0 127))) (and (and (and (<= (+ ~a4~0 89) 0) .cse8) .cse14) (<= .cse26 0) (<= 0 .cse26) .cse15)) (and .cse23 (and .cse14 .cse22 .cse15 .cse19)) (and (exists ((v_~a0~0_832 Int)) (let ((.cse27 (* 9 v_~a0~0_832))) (and (= (mod .cse27 10) 0) (< 0 (+ v_~a0~0_832 61)) (<= (div .cse27 10) (+ ~a0~0 595384))))) (and .cse0 (and .cse6 .cse2))) (and (and .cse16 (and .cse0 .cse1 .cse28)) (<= 533309 ~a29~0)) (and .cse11 .cse18 .cse1 .cse8 .cse25 .cse3) (and (and (and .cse14 .cse22 .cse15) .cse4) .cse29) (and .cse0 .cse1 .cse8 .cse10) (and .cse0 .cse30) (and .cse31 .cse7 .cse18) (and .cse29 .cse13) (and .cse16 (and .cse20 .cse14 .cse15)) (and .cse16 (and .cse4 .cse20)) (and .cse0 .cse1 .cse31) (and .cse1 .cse6 .cse28 (and .cse8 .cse32 .cse4)))))))) [2018-11-06 21:36:20,490 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L72(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,491 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L75(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,492 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L78(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,493 INFO L425 ceAbstractionStarter]: For program point L81(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L84(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,494 INFO L425 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L87(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2018-11-06 21:36:20,495 INFO L425 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,496 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-06 21:36:20,496 INFO L425 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,496 INFO L425 ceAbstractionStarter]: For program point L90(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,496 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,496 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-06 21:36:20,496 INFO L425 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,496 INFO L425 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,496 INFO L425 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,496 INFO L425 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L93(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-06 21:36:20,497 INFO L425 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L96(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L99(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:36:20,498 INFO L425 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2018-11-06 21:36:20,499 INFO L425 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2018-11-06 21:36:20,510 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,511 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,511 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,536 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,536 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,536 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,550 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,550 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,550 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,560 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,560 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,560 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,569 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,569 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,572 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,575 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,576 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,576 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:36:20 BoogieIcfgContainer [2018-11-06 21:36:20,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:36:20,582 INFO L168 Benchmark]: Toolchain (without parser) took 191043.97 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:36:20,584 INFO L168 Benchmark]: CDTParser took 1.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:36:20,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1269.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:36:20,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 414.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.1 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -837.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:36:20,586 INFO L168 Benchmark]: Boogie Preprocessor took 276.83 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:36:20,586 INFO L168 Benchmark]: RCFGBuilder took 7362.21 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 317.8 MB). Peak memory consumption was 317.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:36:20,587 INFO L168 Benchmark]: TraceAbstraction took 181714.26 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 3.8 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-06 21:36:20,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 1.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1269.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 414.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.1 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -837.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 276.83 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7362.21 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 317.8 MB). Peak memory consumption was 317.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 181714.26 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 3.8 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 205]: 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: 1766]: Loop Invariant [2018-11-06 21:36:20,601 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,602 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,602 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2) && 0 <= a0 + 592935) || (a29 <= 43 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && a2 == 4) && 0 <= a29 + 15)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && ((0 < a0 + 147 || a29 + 16 <= 0) || !(4 == input))) && a2 == 4) && 0 <= a0 + 592935)) || ((((a2 == 2 && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 3)) && 0 <= a29 + 15)) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 0 <= a0 + 592935)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a29 + 15) && 0 <= a0 + 592935)) || ((!(2 == a2) && a4 + 86 <= 0 && !(a2 == 3)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 4) && 43 < a29)) || (((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && !(4 == a2)) || ((!(2 == a2) && a4 + 86 <= 0 && !(a2 == 3)) && !(4 == a2))) && 0 <= a29 + 15) && 2722 <= a0) && a2 == 5)) || (((a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && (((0 < a4 + 86 || a29 <= 43) || !(1 == input)) || a0 + 61 <= 0)) && 2722 <= a0)) || (((a2 == 2 && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 3)) && 0 <= a29 + 15)) && 2722 <= a0)) || ((a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && a29 + 145 <= 0)) || (a29 + 145 <= 0 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && a2 == 4) && 4694 <= a0) || (a2 == 4 && (a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144)) || ((((0 < a4 + 86 || a29 <= 43) || !(1 == input)) || a0 + 61 <= 0) && ((0 <= a0 + 44 && a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && a0 + 44 <= 0) && 43 < a29)) || ((\exists v_~a0~0_832 : int :: (9 * v_~a0~0_832 % 10 == 0 && 0 < v_~a0~0_832 + 61) && 9 * v_~a0~0_832 / 10 <= a0 + 595384) && a0 + 98 <= 0 && 0 <= a29 + 15 && a2 == 2)) || ((a2 == 5 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 595423) && 533309 <= a29)) || (((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144) && 0 <= a0 + 592935)) || ((((0 <= a0 + 44 && a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && a0 + 44 <= 0) && a29 <= 43) && 0 < a29 + 16)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a0 + 147)) || (a0 + 98 <= 0 && a2 == 2 && a4 + 86 <= 0 && !(a2 == 3))) || ((a2 == 3 && a4 + 86 <= 0) && a0 + 61 <= 0)) || (0 < a29 + 16 && ((a2 == 2 && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 3)) && 0 <= a29 + 15)))) || (a2 == 5 && ((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && !(4 == a2)) || ((!(2 == a2) && a4 + 86 <= 0 && !(a2 == 3)) && !(4 == a2))) && 0 <= a29 + 15) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (a2 == 5 && a29 <= 43 && ((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && !(4 == a2)) || ((!(2 == a2) && a4 + 86 <= 0 && !(a2 == 3)) && !(4 == a2))) && 0 <= a29 + 15)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 3)) || (((a4 + 42 <= 0 && 0 <= a29 + 15) && 0 <= a0 + 595423) && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) - InvariantResult [Line: 23]: Loop Invariant [2018-11-06 21:36:20,610 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,610 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,610 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,614 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,614 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,614 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2) && 0 <= a0 + 592935) || (a29 <= 43 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && a2 == 4) && 0 <= a29 + 15)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && ((0 < a0 + 147 || a29 + 16 <= 0) || !(4 == input))) && a2 == 4) && 0 <= a0 + 592935)) || ((((a2 == 2 && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 3)) && 0 <= a29 + 15)) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 0 <= a0 + 592935)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a29 + 15) && 0 <= a0 + 592935)) || ((!(2 == a2) && a4 + 86 <= 0 && !(a2 == 3)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 4) && 43 < a29)) || (((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && !(4 == a2)) || ((!(2 == a2) && a4 + 86 <= 0 && !(a2 == 3)) && !(4 == a2))) && 0 <= a29 + 15) && 2722 <= a0) && a2 == 5)) || (((a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && (((0 < a4 + 86 || a29 <= 43) || !(1 == input)) || a0 + 61 <= 0)) && 2722 <= a0)) || (((a2 == 2 && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 3)) && 0 <= a29 + 15)) && 2722 <= a0)) || ((a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && a29 + 145 <= 0)) || (a29 + 145 <= 0 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && a2 == 4) && 4694 <= a0) || (a2 == 4 && (a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144)) || (((((a4 + 89 <= 0 && a2 == 1) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((((0 < a4 + 86 || a29 <= 43) || !(1 == input)) || a0 + 61 <= 0) && ((0 <= a0 + 44 && a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && a0 + 44 <= 0) && 43 < a29)) || ((\exists v_~a0~0_832 : int :: (9 * v_~a0~0_832 % 10 == 0 && 0 < v_~a0~0_832 + 61) && 9 * v_~a0~0_832 / 10 <= a0 + 595384) && a0 + 98 <= 0 && 0 <= a29 + 15 && a2 == 2)) || ((a2 == 5 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 595423) && 533309 <= a29)) || (((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144) && 0 <= a0 + 592935)) || ((((0 <= a0 + 44 && a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && a0 + 44 <= 0) && a29 <= 43) && 0 < a29 + 16)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a0 + 147)) || (a0 + 98 <= 0 && a2 == 2 && a4 + 86 <= 0 && !(a2 == 3))) || ((a2 == 3 && a4 + 86 <= 0) && a0 + 61 <= 0)) || (0 < a29 + 16 && ((a2 == 2 && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 3)) && 0 <= a29 + 15)))) || (a2 == 5 && ((((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && !(4 == a2)) || ((!(2 == a2) && a4 + 86 <= 0 && !(a2 == 3)) && !(4 == a2))) && 0 <= a29 + 15) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (a2 == 5 && a29 <= 43 && ((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && !(4 == a2)) || ((!(2 == a2) && a4 + 86 <= 0 && !(a2 == 3)) && !(4 == a2))) && 0 <= a29 + 15)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 3)) || (((a4 + 42 <= 0 && 0 <= a29 + 15) && 0 <= a0 + 595423) && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) - InvariantResult [Line: 1658]: Loop Invariant [2018-11-06 21:36:20,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,622 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,622 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] [2018-11-06 21:36:20,622 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_832,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((0 <= a0 + 44 && a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && a0 + 44 <= 0) && 0 < a29 + 16) && a29 <= 43) || (0 < a29 + 16 && (((0 <= a29 + 15 && a2 == 2) && a4 + 86 <= 0 && !(a2 == 3)) || (a2 == 2 && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3))))) || (((((a4 + 89 <= 0 && a2 == 1) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((((!(1 == input) && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 == 4) && 43 < a29)) || ((((0 < a4 + 86 || a29 <= 43) || !(4 == input)) && a2 == 5) && 2722 <= a0 && (!(4 == a2) && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && 0 <= a29 + 15)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 0 <= a0 + 592935)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 4) && 0 < a0 + 147)) || ((((0 < a4 + 86 || a29 <= 43) || !(4 == input)) && a2 == 5) && (0 <= a0 + 44 && (!(4 == a2) && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && 0 <= a29 + 15) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && a29 + 145 <= 0)) || (a29 <= 43 && (((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && 0 <= a29 + 15) && a2 == 4)) || (((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144) && 0 <= a0 + 592935)) || (a2 == 5 && ((!(4 == a2) && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && 0 <= a29 + 15) && a29 <= 43)) || (((((0 < a4 + 86 || a29 <= 43) || !(1 == input)) || a0 + 61 <= 0) && 2722 <= a0) && a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a29 <= 43) && a2 == 1 && 0 < a4 + 86) && 0 <= a0 + 595423)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a29 + 15) && !(5 == input)) && 0 <= a0 + 592935)) || ((((0 < a4 + 86 || a29 <= 43) || !(1 == input)) || a0 + 61 <= 0) && ((0 <= a0 + 44 && a4 + 42 <= 0 && 0 < a0 + 61 && a2 == 3) && a0 + 44 <= 0) && 43 < a29)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 16 <= 0 || !(4 == input))) && a2 == 4) && a29 <= 43) && 0 <= a0 + 592935)) || ((a2 == 3 && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((((0 <= a29 + 15 && a2 == 2) && a4 + 86 <= 0 && !(a2 == 3)) || (a2 == 2 && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3))) && 0 <= a0 + 44) && a0 + 44 <= 0)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 3)) || (((((a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3)) && 4694 <= a0) && a29 + 145 <= 0) && a2 == 4) || (a2 == 4 && (a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144)) || ((\exists v_~a0~0_832 : int :: (9 * v_~a0~0_832 % 10 == 0 && 0 < v_~a0~0_832 + 61) && 9 * v_~a0~0_832 / 10 <= a0 + 595384) && a0 + 98 <= 0 && 0 <= a29 + 15 && a2 == 2)) || (((a0 + 98 <= 0 && 0 < a0 + 147) && a4 + 42 <= 0) && a2 == 1)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2) && 0 <= a0 + 592935)) || (2722 <= a0 && (((0 <= a29 + 15 && a2 == 2) && a4 + 86 <= 0 && !(a2 == 3)) || (a2 == 2 && (a4 + 86 <= 0 && 0 < a0 + 61) && !(a2 == 3))))) || (a0 + 98 <= 0 && a4 + 86 <= 0 && !(a2 == 3))) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((!(2 == a2) && a0 + 61 <= 0) && a4 + 86 <= 0 && !(a2 == 3))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 5) && 0 <= a0 + 595423) && 533309 <= a29) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. SAFE Result, 181.5s OverallTime, 22 OverallIterations, 10 TraceHistogramMax, 101.6s AutomataDifference, 0.0s DeadEndRemovalTime, 23.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 5404 SDtfs, 24114 SDslu, 3040 SDs, 0 SdLazy, 61737 SolverSat, 6865 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 83.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10234 GetRequests, 10058 SyntacticMatches, 29 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18652occurred in iteration=20, 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: 2.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 28863 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 366 NumberOfFragments, 2683 HoareAnnotationTreeSize, 4 FomulaSimplifications, 375734 FormulaSimplificationTreeSizeReduction, 4.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 4203763 FormulaSimplificationTreeSizeReductionInter, 19.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 31.1s InterpolantComputationTime, 27201 NumberOfCodeBlocks, 27201 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 27170 ConstructedInterpolants, 334 QuantifiedInterpolants, 122409235 SizeOfPredicates, 12 NumberOfNonLiveVariables, 11402 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 51229/56185 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...