java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:07:34,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:07:34,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:07:34,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:07:34,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:07:34,594 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:07:34,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:07:34,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:07:34,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:07:34,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:07:34,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:07:34,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:07:34,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:07:34,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:07:34,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:07:34,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:07:34,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:07:34,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:07:34,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:07:34,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:07:34,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:07:34,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:07:34,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:07:34,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:07:34,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:07:34,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:07:34,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:07:34,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:07:34,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:07:34,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:07:34,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:07:34,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:07:34,626 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:07:34,626 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:07:34,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:07:34,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:07:34,629 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 21:07:34,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:07:34,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:07:34,646 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:07:34,646 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:07:34,649 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:07:34,649 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:07:34,650 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:07:34,650 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:07:34,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:07:34,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:07:34,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:07:34,651 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:07:34,651 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:07:34,651 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:07:34,651 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:07:34,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:07:34,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:07:34,652 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:07:34,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:07:34,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:07:34,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:07:34,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:07:34,654 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:07:34,654 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:07:34,655 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:07:34,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:07:34,655 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:07:34,655 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:07:34,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:07:34,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:07:34,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:07:34,752 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:07:34,752 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:07:34,753 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c [2018-10-26 21:07:34,829 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8034cb5a4/e521417458ea4226aa8f03cc27c4f707/FLAGdd293ddb6 [2018-10-26 21:07:35,414 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:07:35,415 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c [2018-10-26 21:07:35,449 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8034cb5a4/e521417458ea4226aa8f03cc27c4f707/FLAGdd293ddb6 [2018-10-26 21:07:35,466 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8034cb5a4/e521417458ea4226aa8f03cc27c4f707 [2018-10-26 21:07:35,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:07:35,480 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:07:35,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:07:35,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:07:35,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:07:35,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:07:35" (1/1) ... [2018-10-26 21:07:35,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521bf747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:35, skipping insertion in model container [2018-10-26 21:07:35,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:07:35" (1/1) ... [2018-10-26 21:07:35,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:07:35,564 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:07:36,078 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:07:36,083 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:07:36,238 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:07:36,256 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:07:36,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36 WrapperNode [2018-10-26 21:07:36,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:07:36,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:07:36,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:07:36,258 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:07:36,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... [2018-10-26 21:07:36,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... [2018-10-26 21:07:36,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:07:36,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:07:36,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:07:36,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:07:36,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... [2018-10-26 21:07:36,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... [2018-10-26 21:07:36,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... [2018-10-26 21:07:36,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... [2018-10-26 21:07:36,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... [2018-10-26 21:07:36,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... [2018-10-26 21:07:36,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... [2018-10-26 21:07:36,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:07:36,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:07:36,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:07:36,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:07:36,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:07:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:07:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:07:36,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:07:39,800 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:07:39,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:07:39 BoogieIcfgContainer [2018-10-26 21:07:39,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:07:39,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:07:39,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:07:39,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:07:39,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:07:35" (1/3) ... [2018-10-26 21:07:39,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df47b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:07:39, skipping insertion in model container [2018-10-26 21:07:39,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:07:36" (2/3) ... [2018-10-26 21:07:39,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df47b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:07:39, skipping insertion in model container [2018-10-26 21:07:39,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:07:39" (3/3) ... [2018-10-26 21:07:39,816 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label56_true-unreach-call.c [2018-10-26 21:07:39,829 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:07:39,846 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:07:39,864 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:07:39,901 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:07:39,902 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:07:39,902 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:07:39,902 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:07:39,903 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:07:39,903 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:07:39,903 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:07:39,903 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:07:39,903 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:07:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-10-26 21:07:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:07:39,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:07:39,936 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] [2018-10-26 21:07:39,939 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:07:39,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:07:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1155896462, now seen corresponding path program 1 times [2018-10-26 21:07:39,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:07:39,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:07:40,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:40,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:07:40,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:07:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:07:40,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:07:40,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:07:40,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:07:40,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:07:40,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:07:40,386 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 4 states. [2018-10-26 21:07:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:07:43,255 INFO L93 Difference]: Finished difference Result 698 states and 1250 transitions. [2018-10-26 21:07:43,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:07:43,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-26 21:07:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:07:43,278 INFO L225 Difference]: With dead ends: 698 [2018-10-26 21:07:43,279 INFO L226 Difference]: Without dead ends: 484 [2018-10-26 21:07:43,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:07:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-26 21:07:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2018-10-26 21:07:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-26 21:07:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 811 transitions. [2018-10-26 21:07:43,363 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 811 transitions. Word has length 24 [2018-10-26 21:07:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:07:43,364 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 811 transitions. [2018-10-26 21:07:43,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:07:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 811 transitions. [2018-10-26 21:07:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 21:07:43,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:07:43,369 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:07:43,369 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:07:43,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:07:43,370 INFO L82 PathProgramCache]: Analyzing trace with hash -47374565, now seen corresponding path program 1 times [2018-10-26 21:07:43,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:07:43,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:07:43,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:43,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:07:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:07:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:07:43,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:07:43,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:07:43,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:07:43,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:07:43,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:07:43,794 INFO L87 Difference]: Start difference. First operand 484 states and 811 transitions. Second operand 4 states. [2018-10-26 21:07:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:07:47,645 INFO L93 Difference]: Finished difference Result 1106 states and 1836 transitions. [2018-10-26 21:07:47,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:07:47,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-26 21:07:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:07:47,651 INFO L225 Difference]: With dead ends: 1106 [2018-10-26 21:07:47,652 INFO L226 Difference]: Without dead ends: 624 [2018-10-26 21:07:47,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:07:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-26 21:07:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2018-10-26 21:07:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-26 21:07:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 952 transitions. [2018-10-26 21:07:47,692 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 952 transitions. Word has length 94 [2018-10-26 21:07:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:07:47,693 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 952 transitions. [2018-10-26 21:07:47,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:07:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 952 transitions. [2018-10-26 21:07:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 21:07:47,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:07:47,698 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:07:47,698 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:07:47,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:07:47,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1289860076, now seen corresponding path program 1 times [2018-10-26 21:07:47,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:07:47,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:07:47,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:47,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:07:47,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:07:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:07:47,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:07:47,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:07:47,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:07:47,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:07:47,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:07:47,952 INFO L87 Difference]: Start difference. First operand 624 states and 952 transitions. Second operand 4 states. [2018-10-26 21:07:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:07:52,266 INFO L93 Difference]: Finished difference Result 2366 states and 3680 transitions. [2018-10-26 21:07:52,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:07:52,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-26 21:07:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:07:52,281 INFO L225 Difference]: With dead ends: 2366 [2018-10-26 21:07:52,281 INFO L226 Difference]: Without dead ends: 1744 [2018-10-26 21:07:52,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:07:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2018-10-26 21:07:52,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1744. [2018-10-26 21:07:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2018-10-26 21:07:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2441 transitions. [2018-10-26 21:07:52,346 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2441 transitions. Word has length 100 [2018-10-26 21:07:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:07:52,348 INFO L481 AbstractCegarLoop]: Abstraction has 1744 states and 2441 transitions. [2018-10-26 21:07:52,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:07:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2441 transitions. [2018-10-26 21:07:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-26 21:07:52,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:07:52,369 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:07:52,369 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:07:52,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:07:52,370 INFO L82 PathProgramCache]: Analyzing trace with hash -525084239, now seen corresponding path program 1 times [2018-10-26 21:07:52,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:07:52,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:07:52,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:52,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:07:52,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:07:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:07:52,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:07:52,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:07:52,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:07:52,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:07:52,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:07:52,817 INFO L87 Difference]: Start difference. First operand 1744 states and 2441 transitions. Second operand 4 states. [2018-10-26 21:07:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:07:54,433 INFO L93 Difference]: Finished difference Result 3906 states and 5503 transitions. [2018-10-26 21:07:54,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:07:54,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-10-26 21:07:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:07:54,446 INFO L225 Difference]: With dead ends: 3906 [2018-10-26 21:07:54,447 INFO L226 Difference]: Without dead ends: 2164 [2018-10-26 21:07:54,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:07:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-10-26 21:07:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2164. [2018-10-26 21:07:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2164 states. [2018-10-26 21:07:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 2744 transitions. [2018-10-26 21:07:54,491 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 2744 transitions. Word has length 162 [2018-10-26 21:07:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:07:54,491 INFO L481 AbstractCegarLoop]: Abstraction has 2164 states and 2744 transitions. [2018-10-26 21:07:54,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:07:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2744 transitions. [2018-10-26 21:07:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 21:07:54,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:07:54,496 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:07:54,497 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:07:54,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:07:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash 642992039, now seen corresponding path program 1 times [2018-10-26 21:07:54,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:07:54,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:07:54,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:54,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:07:54,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:07:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 21:07:54,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:07:54,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:07:54,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:07:54,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:07:54,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:07:54,865 INFO L87 Difference]: Start difference. First operand 2164 states and 2744 transitions. Second operand 5 states. [2018-10-26 21:07:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:07:59,048 INFO L93 Difference]: Finished difference Result 7702 states and 9785 transitions. [2018-10-26 21:07:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:07:59,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-10-26 21:07:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:07:59,074 INFO L225 Difference]: With dead ends: 7702 [2018-10-26 21:07:59,074 INFO L226 Difference]: Without dead ends: 5540 [2018-10-26 21:07:59,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:07:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5540 states. [2018-10-26 21:07:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5540 to 4124. [2018-10-26 21:07:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2018-10-26 21:07:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 4994 transitions. [2018-10-26 21:07:59,179 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 4994 transitions. Word has length 195 [2018-10-26 21:07:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:07:59,179 INFO L481 AbstractCegarLoop]: Abstraction has 4124 states and 4994 transitions. [2018-10-26 21:07:59,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:07:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 4994 transitions. [2018-10-26 21:07:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-26 21:07:59,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:07:59,189 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:07:59,190 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:07:59,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:07:59,190 INFO L82 PathProgramCache]: Analyzing trace with hash -150687317, now seen corresponding path program 1 times [2018-10-26 21:07:59,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:07:59,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:07:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:59,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:07:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:07:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:07:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:07:59,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:07:59,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:07:59,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:07:59,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:07:59,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:07:59,805 INFO L87 Difference]: Start difference. First operand 4124 states and 4994 transitions. Second operand 5 states. [2018-10-26 21:08:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:01,388 INFO L93 Difference]: Finished difference Result 8106 states and 9841 transitions. [2018-10-26 21:08:01,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:08:01,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2018-10-26 21:08:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:01,400 INFO L225 Difference]: With dead ends: 8106 [2018-10-26 21:08:01,400 INFO L226 Difference]: Without dead ends: 2108 [2018-10-26 21:08:01,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2018-10-26 21:08:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1968. [2018-10-26 21:08:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2018-10-26 21:08:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2178 transitions. [2018-10-26 21:08:01,439 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2178 transitions. Word has length 238 [2018-10-26 21:08:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:01,439 INFO L481 AbstractCegarLoop]: Abstraction has 1968 states and 2178 transitions. [2018-10-26 21:08:01,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2178 transitions. [2018-10-26 21:08:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-26 21:08:01,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:01,445 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:08:01,445 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:01,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:01,445 INFO L82 PathProgramCache]: Analyzing trace with hash -110008198, now seen corresponding path program 1 times [2018-10-26 21:08:01,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:01,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:01,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:01,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:01,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 21:08:01,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:01,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:08:01,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:01,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:01,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:01,787 INFO L87 Difference]: Start difference. First operand 1968 states and 2178 transitions. Second operand 5 states. [2018-10-26 21:08:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:02,918 INFO L93 Difference]: Finished difference Result 3934 states and 4354 transitions. [2018-10-26 21:08:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:08:02,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2018-10-26 21:08:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:02,928 INFO L225 Difference]: With dead ends: 3934 [2018-10-26 21:08:02,928 INFO L226 Difference]: Without dead ends: 1967 [2018-10-26 21:08:02,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2018-10-26 21:08:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1827. [2018-10-26 21:08:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-10-26 21:08:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 1954 transitions. [2018-10-26 21:08:02,959 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 1954 transitions. Word has length 262 [2018-10-26 21:08:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:02,959 INFO L481 AbstractCegarLoop]: Abstraction has 1827 states and 1954 transitions. [2018-10-26 21:08:02,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 1954 transitions. [2018-10-26 21:08:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-26 21:08:02,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:02,965 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:08:02,966 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:02,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:02,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1440191249, now seen corresponding path program 1 times [2018-10-26 21:08:02,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:02,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:02,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:02,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:02,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 22 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:03,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:08:03,271 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:08:03,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:03,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:08:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 22 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:08:04,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:08:04,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-10-26 21:08:04,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:08:04,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:08:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:08:04,353 INFO L87 Difference]: Start difference. First operand 1827 states and 1954 transitions. Second operand 7 states. [2018-10-26 21:08:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:08,845 INFO L93 Difference]: Finished difference Result 5894 states and 6367 transitions. [2018-10-26 21:08:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:08:08,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 274 [2018-10-26 21:08:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:08,862 INFO L225 Difference]: With dead ends: 5894 [2018-10-26 21:08:08,862 INFO L226 Difference]: Without dead ends: 3927 [2018-10-26 21:08:08,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:08:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2018-10-26 21:08:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 2946. [2018-10-26 21:08:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2018-10-26 21:08:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3170 transitions. [2018-10-26 21:08:08,924 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3170 transitions. Word has length 274 [2018-10-26 21:08:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:08,925 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 3170 transitions. [2018-10-26 21:08:08,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:08:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3170 transitions. [2018-10-26 21:08:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-26 21:08:08,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:08,933 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:08:08,934 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:08,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:08,934 INFO L82 PathProgramCache]: Analyzing trace with hash 856611996, now seen corresponding path program 1 times [2018-10-26 21:08:08,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:08,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:08,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:08,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 223 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 21:08:09,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:08:09,485 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 21:08:09,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:09,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:08:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 223 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 21:08:09,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:08:09,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-10-26 21:08:09,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:08:09,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:08:09,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:09,782 INFO L87 Difference]: Start difference. First operand 2946 states and 3170 transitions. Second operand 5 states. [2018-10-26 21:08:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:10,950 INFO L93 Difference]: Finished difference Result 7011 states and 7544 transitions. [2018-10-26 21:08:10,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:08:10,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 329 [2018-10-26 21:08:10,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:10,964 INFO L225 Difference]: With dead ends: 7011 [2018-10-26 21:08:10,964 INFO L226 Difference]: Without dead ends: 3925 [2018-10-26 21:08:10,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:08:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-10-26 21:08:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3505. [2018-10-26 21:08:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2018-10-26 21:08:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 3716 transitions. [2018-10-26 21:08:11,025 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 3716 transitions. Word has length 329 [2018-10-26 21:08:11,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:11,025 INFO L481 AbstractCegarLoop]: Abstraction has 3505 states and 3716 transitions. [2018-10-26 21:08:11,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:08:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 3716 transitions. [2018-10-26 21:08:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-26 21:08:11,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:11,037 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-26 21:08:11,037 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:11,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1964512189, now seen corresponding path program 1 times [2018-10-26 21:08:11,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:11,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:11,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:11,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:11,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-26 21:08:11,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:08:11,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:08:11,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:08:11,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:08:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:08:11,463 INFO L87 Difference]: Start difference. First operand 3505 states and 3716 transitions. Second operand 4 states. [2018-10-26 21:08:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:08:13,157 INFO L93 Difference]: Finished difference Result 7428 states and 7898 transitions. [2018-10-26 21:08:13,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:08:13,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 415 [2018-10-26 21:08:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:08:13,169 INFO L225 Difference]: With dead ends: 7428 [2018-10-26 21:08:13,169 INFO L226 Difference]: Without dead ends: 4065 [2018-10-26 21:08:13,173 INFO L605 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-10-26 21:08:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2018-10-26 21:08:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 3925. [2018-10-26 21:08:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3925 states. [2018-10-26 21:08:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 4154 transitions. [2018-10-26 21:08:13,232 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 4154 transitions. Word has length 415 [2018-10-26 21:08:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:08:13,232 INFO L481 AbstractCegarLoop]: Abstraction has 3925 states and 4154 transitions. [2018-10-26 21:08:13,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:08:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 4154 transitions. [2018-10-26 21:08:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-26 21:08:13,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:08:13,246 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2018-10-26 21:08:13,246 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:08:13,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:08:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash -831427639, now seen corresponding path program 1 times [2018-10-26 21:08:13,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:08:13,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:08:13,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:13,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:13,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:08:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 48 proven. 449 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 21:08:13,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:08:13,986 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 21:08:13,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:08:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:08:14,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:08:14,679 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 17 [2018-10-26 21:08:17,118 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 70 DAG size of output: 27 [2018-10-26 21:08:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 171 proven. 326 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 21:08:17,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:08:17,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-10-26 21:08:17,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:08:17,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:08:17,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:08:17,812 INFO L87 Difference]: Start difference. First operand 3925 states and 4154 transitions. Second operand 13 states. [2018-10-26 21:08:20,673 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-10-26 21:09:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:42,350 INFO L93 Difference]: Finished difference Result 10412 states and 11026 transitions. [2018-10-26 21:09:42,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 21:09:42,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 424 [2018-10-26 21:09:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:42,377 INFO L225 Difference]: With dead ends: 10412 [2018-10-26 21:09:42,377 INFO L226 Difference]: Without dead ends: 6348 [2018-10-26 21:09:42,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2018-10-26 21:09:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6348 states. [2018-10-26 21:09:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6348 to 3784. [2018-10-26 21:09:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-10-26 21:09:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 4007 transitions. [2018-10-26 21:09:42,463 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 4007 transitions. Word has length 424 [2018-10-26 21:09:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:42,464 INFO L481 AbstractCegarLoop]: Abstraction has 3784 states and 4007 transitions. [2018-10-26 21:09:42,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:09:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 4007 transitions. [2018-10-26 21:09:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-26 21:09:42,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:42,475 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:09:42,475 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:42,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2104286675, now seen corresponding path program 1 times [2018-10-26 21:09:42,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:42,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:42,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 571 proven. 110 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-26 21:09:43,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:09:43,407 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 21:09:43,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:43,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:09:43,898 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-10-26 21:09:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-26 21:09:44,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:09:44,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-10-26 21:09:44,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:09:44,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:09:44,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:09:44,216 INFO L87 Difference]: Start difference. First operand 3784 states and 4007 transitions. Second operand 8 states. [2018-10-26 21:09:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:49,838 INFO L93 Difference]: Finished difference Result 10226 states and 10829 transitions. [2018-10-26 21:09:49,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:09:49,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 538 [2018-10-26 21:09:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:49,854 INFO L225 Difference]: With dead ends: 10226 [2018-10-26 21:09:49,855 INFO L226 Difference]: Without dead ends: 6304 [2018-10-26 21:09:49,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:09:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2018-10-26 21:09:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 3924. [2018-10-26 21:09:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3924 states. [2018-10-26 21:09:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 4155 transitions. [2018-10-26 21:09:49,948 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 4155 transitions. Word has length 538 [2018-10-26 21:09:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:49,949 INFO L481 AbstractCegarLoop]: Abstraction has 3924 states and 4155 transitions. [2018-10-26 21:09:49,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:09:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 4155 transitions. [2018-10-26 21:09:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-26 21:09:49,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:49,961 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, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:09:49,962 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:49,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1016352259, now seen corresponding path program 1 times [2018-10-26 21:09:49,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:49,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:49,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:49,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:49,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:50,545 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 21:09:50,987 WARN L179 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-10-26 21:09:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 697 proven. 228 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-10-26 21:09:51,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:09:51,672 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 21:09:51,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:51,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:09:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-26 21:09:52,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:09:52,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-26 21:09:52,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:09:52,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:09:52,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:09:52,049 INFO L87 Difference]: Start difference. First operand 3924 states and 4155 transitions. Second operand 11 states. [2018-10-26 21:09:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:54,234 INFO L93 Difference]: Finished difference Result 6811 states and 7208 transitions. [2018-10-26 21:09:54,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:09:54,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 568 [2018-10-26 21:09:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:54,235 INFO L225 Difference]: With dead ends: 6811 [2018-10-26 21:09:54,235 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:09:54,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 575 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-26 21:09:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:09:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:09:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:09:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:09:54,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 568 [2018-10-26 21:09:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:54,240 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:09:54,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:09:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:09:54,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:09:54,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:09:54,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,562 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 271 [2018-10-26 21:09:54,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:09:54,899 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 271 [2018-10-26 21:10:00,813 WARN L179 SmtUtils]: Spent 5.91 s on a formula simplification. DAG size of input: 262 DAG size of output: 84 [2018-10-26 21:10:05,263 WARN L179 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 262 DAG size of output: 84 [2018-10-26 21:10:05,267 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-10-26 21:10:05,267 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,267 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,267 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,267 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-26 21:10:05,268 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-10-26 21:10:05,269 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-10-26 21:10:05,270 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-10-26 21:10:05,270 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-26 21:10:05,270 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-26 21:10:05,270 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-26 21:10:05,270 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-26 21:10:05,270 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-26 21:10:05,270 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-10-26 21:10:05,270 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-10-26 21:10:05,270 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-10-26 21:10:05,271 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-10-26 21:10:05,271 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-10-26 21:10:05,271 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,271 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,271 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,271 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,271 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,271 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-10-26 21:10:05,271 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-26 21:10:05,272 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-26 21:10:05,272 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-26 21:10:05,272 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-26 21:10:05,272 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-26 21:10:05,272 INFO L421 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse17 (= ~a10~0 4)) (.cse6 (= ~a10~0 1)) (.cse19 (+ ~a1~0 13))) (let ((.cse2 (= ~a12~0 0)) (.cse7 (<= .cse19 0)) (.cse3 (= ~a4~0 14)) (.cse15 (<= ~a1~0 218)) (.cse11 (= ~a19~0 9)) (.cse18 (not .cse6)) (.cse16 (not .cse17))) (let ((.cse1 (< 38 ~a1~0)) (.cse0 (= ~a10~0 3)) (.cse13 (<= ~a1~0 12)) (.cse4 (and .cse15 .cse11 (< 0 .cse19) .cse18 .cse16)) (.cse12 (= ~a10~0 0)) (.cse8 (= ~a19~0 8)) (.cse9 (< 218 ~a1~0)) (.cse14 (= ~a10~0 2)) (.cse5 (and .cse11 .cse2 .cse18 .cse7 .cse3))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse0 .cse5) (and (and .cse6 .cse2 .cse7) .cse3) (and .cse1 .cse2 .cse8 .cse3) (and .cse9 (<= ~a1~0 589891) .cse6 .cse2 .cse3) (and .cse6 .cse2 (<= 56 ~a1~0) .cse3 (exists ((v_prenex_41 Int)) (let ((.cse10 (* 5 (div v_prenex_41 5)))) (and (<= v_prenex_41 218) (<= 0 .cse10) (<= ~a1~0 (+ (div .cse10 5) 505228)) (= 0 (mod v_prenex_41 5)))))) (and .cse11 .cse12 .cse2 .cse3) (and .cse0 .cse9 .cse11 .cse2 .cse3 (<= ~a1~0 589865)) (and .cse6 .cse2 .cse13 (not .cse11) .cse3) (and .cse0 .cse2 .cse13 .cse3 .cse4) (and (not .cse8) (<= ~a19~0 8)) (and .cse2 .cse8 .cse7 .cse3) (and .cse14 .cse2 .cse13 .cse3 .cse4) (and .cse15 (and .cse12 .cse2 .cse3)) (and .cse8 .cse16) (and .cse9 .cse14 .cse11 .cse2 .cse3) (and .cse14 .cse5) (and (<= ~a1~0 505232) .cse11 .cse17 .cse2 .cse3))))) [2018-10-26 21:10:05,273 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-10-26 21:10:05,273 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-10-26 21:10:05,273 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-10-26 21:10:05,273 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-10-26 21:10:05,273 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,273 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,273 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,273 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,273 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-10-26 21:10:05,274 INFO L428 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2018-10-26 21:10:05,274 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-10-26 21:10:05,275 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-26 21:10:05,276 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-26 21:10:05,277 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-26 21:10:05,277 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-10-26 21:10:05,277 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-10-26 21:10:05,277 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-26 21:10:05,277 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-10-26 21:10:05,277 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-10-26 21:10:05,277 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse17 (= ~a10~0 4)) (.cse6 (= ~a10~0 1)) (.cse19 (+ ~a1~0 13))) (let ((.cse2 (= ~a12~0 0)) (.cse7 (<= .cse19 0)) (.cse3 (= ~a4~0 14)) (.cse15 (<= ~a1~0 218)) (.cse11 (= ~a19~0 9)) (.cse18 (not .cse6)) (.cse16 (not .cse17))) (let ((.cse1 (< 38 ~a1~0)) (.cse0 (= ~a10~0 3)) (.cse13 (<= ~a1~0 12)) (.cse4 (and .cse15 .cse11 (< 0 .cse19) .cse18 .cse16)) (.cse12 (= ~a10~0 0)) (.cse8 (= ~a19~0 8)) (.cse9 (< 218 ~a1~0)) (.cse14 (= ~a10~0 2)) (.cse5 (and .cse11 .cse2 .cse18 .cse7 .cse3))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse0 .cse5) (and (and .cse6 .cse2 .cse7) .cse3) (and .cse1 .cse2 .cse8 .cse3) (and .cse9 (<= ~a1~0 589891) .cse6 .cse2 .cse3) (and .cse6 .cse2 (<= 56 ~a1~0) .cse3 (exists ((v_prenex_41 Int)) (let ((.cse10 (* 5 (div v_prenex_41 5)))) (and (<= v_prenex_41 218) (<= 0 .cse10) (<= ~a1~0 (+ (div .cse10 5) 505228)) (= 0 (mod v_prenex_41 5)))))) (and .cse11 .cse12 .cse2 .cse3) (and .cse0 .cse9 .cse11 .cse2 .cse3 (<= ~a1~0 589865)) (and .cse6 .cse2 .cse13 (not .cse11) .cse3) (and .cse0 .cse2 .cse13 .cse3 .cse4) (and (not .cse8) (<= ~a19~0 8)) (and .cse2 .cse8 .cse7 .cse3) (and .cse14 .cse2 .cse13 .cse3 .cse4) (and .cse15 (and .cse12 .cse2 .cse3)) (and .cse8 .cse16) (and .cse9 .cse14 .cse11 .cse2 .cse3) (and .cse14 .cse5) (and (<= ~a1~0 505232) .cse11 .cse17 .cse2 .cse3))))) [2018-10-26 21:10:05,277 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-10-26 21:10:05,278 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,278 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,278 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,278 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,278 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,278 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-26 21:10:05,278 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,278 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-10-26 21:10:05,278 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-10-26 21:10:05,279 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-10-26 21:10:05,280 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,280 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,280 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,280 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,280 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,280 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,280 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-10-26 21:10:05,280 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-10-26 21:10:05,281 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-26 21:10:05,282 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,283 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,284 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-10-26 21:10:05,285 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-10-26 21:10:05,286 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-10-26 21:10:05,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,307 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,308 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,308 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,308 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,316 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,316 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,316 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:10:05 BoogieIcfgContainer [2018-10-26 21:10:05,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:10:05,322 INFO L168 Benchmark]: Toolchain (without parser) took 149843.11 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -636.6 MB). Peak memory consumption was 890.6 MB. Max. memory is 7.1 GB. [2018-10-26 21:10:05,323 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:10:05,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:10:05,325 INFO L168 Benchmark]: Boogie Procedure Inliner took 189.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-26 21:10:05,326 INFO L168 Benchmark]: Boogie Preprocessor took 114.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-10-26 21:10:05,326 INFO L168 Benchmark]: RCFGBuilder took 3241.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. [2018-10-26 21:10:05,327 INFO L168 Benchmark]: TraceAbstraction took 145515.87 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 775.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 807.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:10:05,332 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 189.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3241.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 145515.87 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 775.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 807.7 MB. 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_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 73]: 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: 582]: Loop Invariant [2018-10-26 21:10:05,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,346 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,346 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,347 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,347 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] Derived loop invariant: (((((((((((((((((a10 == 3 && ((38 < a1 && a12 == 0) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4)) || (a10 == 3 && (((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14)) || (((a10 == 1 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (((38 < a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && 56 <= a1) && a4 == 14) && (\exists v_prenex_41 : int :: ((v_prenex_41 <= 218 && 0 <= 5 * (v_prenex_41 / 5)) && a1 <= 5 * (v_prenex_41 / 5) / 5 + 505228) && 0 == v_prenex_41 % 5))) || (((a19 == 9 && a10 == 0) && a12 == 0) && a4 == 14)) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14)) || ((((a10 == 3 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (!(a19 == 8) && a19 <= 8)) || (((a12 == 0 && a19 == 8) && a1 + 13 <= 0) && a4 == 14)) || ((((a10 == 2 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (a1 <= 218 && (a10 == 0 && a12 == 0) && a4 == 14)) || (a19 == 8 && !(a10 == 4))) || ((((218 < a1 && a10 == 2) && a19 == 9) && a12 == 0) && a4 == 14)) || (a10 == 2 && (((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14)) || ((((a1 <= 505232 && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14) - InvariantResult [Line: 20]: Loop Invariant [2018-10-26 21:10:05,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,353 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-26 21:10:05,353 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] Derived loop invariant: (((((((((((((((((a10 == 3 && ((38 < a1 && a12 == 0) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4)) || (a10 == 3 && (((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14)) || (((a10 == 1 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (((38 < a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && 56 <= a1) && a4 == 14) && (\exists v_prenex_41 : int :: ((v_prenex_41 <= 218 && 0 <= 5 * (v_prenex_41 / 5)) && a1 <= 5 * (v_prenex_41 / 5) / 5 + 505228) && 0 == v_prenex_41 % 5))) || (((a19 == 9 && a10 == 0) && a12 == 0) && a4 == 14)) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14)) || ((((a10 == 3 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (!(a19 == 8) && a19 <= 8)) || (((a12 == 0 && a19 == 8) && a1 + 13 <= 0) && a4 == 14)) || ((((a10 == 2 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (a1 <= 218 && (a10 == 0 && a12 == 0) && a4 == 14)) || (a19 == 8 && !(a10 == 4))) || ((((218 < a1 && a10 == 2) && a19 == 9) && a12 == 0) && a4 == 14)) || (a10 == 2 && (((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14)) || ((((a1 <= 505232 && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 207 locations, 1 error locations. SAFE Result, 145.3s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 119.5s AutomataDifference, 0.0s DeadEndRemovalTime, 11.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1313 SDtfs, 6775 SDslu, 795 SDs, 0 SdLazy, 15852 SolverSat, 2358 SolverUnsat, 39 SolverUnknown, 0 SolverNotchecked, 112.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2228 GetRequests, 2143 SyntacticMatches, 10 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4124occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 8181 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 137 NumberOfFragments, 719 HoareAnnotationTreeSize, 3 FomulaSimplifications, 33958 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 33770 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 5756 NumberOfCodeBlocks, 5756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5738 ConstructedInterpolants, 204 QuantifiedInterpolants, 11769952 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2816 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 5918/7339 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...