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/Problem17_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:48:24,462 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:48:24,464 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:48:24,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:48:24,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:48:24,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:48:24,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:48:24,480 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:48:24,482 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:48:24,483 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:48:24,484 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:48:24,484 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:48:24,485 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:48:24,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:48:24,487 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:48:24,488 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:48:24,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:48:24,490 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:48:24,492 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:48:24,494 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:48:24,495 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:48:24,496 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:48:24,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:48:24,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:48:24,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:48:24,500 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:48:24,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:48:24,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:48:24,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:48:24,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:48:24,504 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:48:24,505 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:48:24,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:48:24,506 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:48:24,507 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:48:24,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:48:24,508 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:48:24,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:48:24,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:48:24,534 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:48:24,535 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:48:24,535 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:48:24,535 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:48:24,536 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:48:24,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:48:24,536 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:48:24,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:48:24,536 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:48:24,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:48:24,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:48:24,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:48:24,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:48:24,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:48:24,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:48:24,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:48:24,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:48:24,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:48:24,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:48:24,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:48:24,539 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:48:24,539 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:48:24,539 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:48:24,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:48:24,540 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:48:24,540 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:48:24,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:48:24,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:48:24,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:48:24,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:48:24,604 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:48:24,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label02_true-unreach-call.c [2018-10-26 21:48:24,664 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6a75f0020/956acfe75eac4cbab9fa1a3cb8101e3c/FLAG8a38b6091 [2018-10-26 21:48:25,393 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:48:25,394 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label02_true-unreach-call.c [2018-10-26 21:48:25,421 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6a75f0020/956acfe75eac4cbab9fa1a3cb8101e3c/FLAG8a38b6091 [2018-10-26 21:48:25,436 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6a75f0020/956acfe75eac4cbab9fa1a3cb8101e3c [2018-10-26 21:48:25,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:48:25,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:48:25,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:48:25,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:48:25,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:48:25,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:48:25" (1/1) ... [2018-10-26 21:48:25,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8de4687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:25, skipping insertion in model container [2018-10-26 21:48:25,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:48:25" (1/1) ... [2018-10-26 21:48:25,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:48:25,599 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:48:26,587 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:48:26,592 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:48:26,950 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:48:26,973 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:48:26,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26 WrapperNode [2018-10-26 21:48:26,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:48:26,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:48:26,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:48:26,975 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:48:26,985 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:48:26" (1/1) ... [2018-10-26 21:48:27,034 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:48:26" (1/1) ... [2018-10-26 21:48:27,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:48:27,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:48:27,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:48:27,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:48:27,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26" (1/1) ... [2018-10-26 21:48:27,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26" (1/1) ... [2018-10-26 21:48:27,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26" (1/1) ... [2018-10-26 21:48:27,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26" (1/1) ... [2018-10-26 21:48:27,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26" (1/1) ... [2018-10-26 21:48:27,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26" (1/1) ... [2018-10-26 21:48:27,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26" (1/1) ... [2018-10-26 21:48:27,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:48:27,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:48:27,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:48:27,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:48:27,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26" (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:48:27,896 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:48:27,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:48:27,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:48:38,627 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:48:38,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:48:38 BoogieIcfgContainer [2018-10-26 21:48:38,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:48:38,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:48:38,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:48:38,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:48:38,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:48:25" (1/3) ... [2018-10-26 21:48:38,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e23a5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:48:38, skipping insertion in model container [2018-10-26 21:48:38,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:48:26" (2/3) ... [2018-10-26 21:48:38,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e23a5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:48:38, skipping insertion in model container [2018-10-26 21:48:38,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:48:38" (3/3) ... [2018-10-26 21:48:38,637 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label02_true-unreach-call.c [2018-10-26 21:48:38,647 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:48:38,657 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:48:38,675 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:48:38,719 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:48:38,719 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:48:38,720 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:48:38,720 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:48:38,720 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:48:38,720 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:48:38,720 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:48:38,720 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:48:38,721 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:48:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-10-26 21:48:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-26 21:48:38,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:48:38,763 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:48:38,766 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:48:38,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:48:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1704727530, now seen corresponding path program 1 times [2018-10-26 21:48:38,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:48:38,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:48:38,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:48:38,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:48:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:48:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:48:39,352 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:48:39,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:48:39,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:48:39,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:48:39,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:48:39,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:48:39,397 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-10-26 21:48:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:48:50,270 INFO L93 Difference]: Finished difference Result 2122 states and 3950 transitions. [2018-10-26 21:48:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:48:50,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-10-26 21:48:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:48:50,310 INFO L225 Difference]: With dead ends: 2122 [2018-10-26 21:48:50,310 INFO L226 Difference]: Without dead ends: 1524 [2018-10-26 21:48:50,319 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:48:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2018-10-26 21:48:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1497. [2018-10-26 21:48:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2018-10-26 21:48:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2656 transitions. [2018-10-26 21:48:50,484 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2656 transitions. Word has length 54 [2018-10-26 21:48:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:48:50,485 INFO L481 AbstractCegarLoop]: Abstraction has 1497 states and 2656 transitions. [2018-10-26 21:48:50,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:48:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2656 transitions. [2018-10-26 21:48:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 21:48:50,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:48:50,494 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:48:50,495 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:48:50,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:48:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1414936813, now seen corresponding path program 1 times [2018-10-26 21:48:50,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:48:50,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:48:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:48:50,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:48:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:48:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:48:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:48:50,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:48:50,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:48:50,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:48:50,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:48:50,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:48:50,792 INFO L87 Difference]: Start difference. First operand 1497 states and 2656 transitions. Second operand 4 states. [2018-10-26 21:49:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:49:04,641 INFO L93 Difference]: Finished difference Result 5604 states and 10151 transitions. [2018-10-26 21:49:04,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:49:04,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-10-26 21:49:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:49:04,665 INFO L225 Difference]: With dead ends: 5604 [2018-10-26 21:49:04,666 INFO L226 Difference]: Without dead ends: 4109 [2018-10-26 21:49:04,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:49:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2018-10-26 21:49:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 4098. [2018-10-26 21:49:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2018-10-26 21:49:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 6039 transitions. [2018-10-26 21:49:04,770 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 6039 transitions. Word has length 129 [2018-10-26 21:49:04,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:49:04,771 INFO L481 AbstractCegarLoop]: Abstraction has 4098 states and 6039 transitions. [2018-10-26 21:49:04,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:49:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 6039 transitions. [2018-10-26 21:49:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 21:49:04,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:49:04,778 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:04,778 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:49:04,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:49:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1695742306, now seen corresponding path program 1 times [2018-10-26 21:49:04,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:49:04,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:49:04,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:04,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:49:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:49:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:49:05,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:49:05,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:49:05,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:49:05,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:49:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:49:05,126 INFO L87 Difference]: Start difference. First operand 4098 states and 6039 transitions. Second operand 4 states. [2018-10-26 21:49:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:49:13,079 INFO L93 Difference]: Finished difference Result 15443 states and 23002 transitions. [2018-10-26 21:49:13,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:49:13,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-10-26 21:49:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:49:13,133 INFO L225 Difference]: With dead ends: 15443 [2018-10-26 21:49:13,133 INFO L226 Difference]: Without dead ends: 11347 [2018-10-26 21:49:13,140 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:49:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11347 states. [2018-10-26 21:49:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11347 to 11347. [2018-10-26 21:49:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2018-10-26 21:49:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 14546 transitions. [2018-10-26 21:49:13,339 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 14546 transitions. Word has length 192 [2018-10-26 21:49:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:49:13,340 INFO L481 AbstractCegarLoop]: Abstraction has 11347 states and 14546 transitions. [2018-10-26 21:49:13,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:49:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 14546 transitions. [2018-10-26 21:49:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-26 21:49:13,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:49:13,345 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-10-26 21:49:13,346 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:49:13,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:49:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1124602966, now seen corresponding path program 1 times [2018-10-26 21:49:13,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:49:13,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:49:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:13,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:49:13,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:49:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:49:13,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:49:13,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:49:13,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:49:13,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:49:13,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:49:13,684 INFO L87 Difference]: Start difference. First operand 11347 states and 14546 transitions. Second operand 4 states. [2018-10-26 21:49:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:49:21,091 INFO L93 Difference]: Finished difference Result 23970 states and 30950 transitions. [2018-10-26 21:49:21,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:49:21,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2018-10-26 21:49:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:49:21,137 INFO L225 Difference]: With dead ends: 23970 [2018-10-26 21:49:21,137 INFO L226 Difference]: Without dead ends: 12625 [2018-10-26 21:49:21,149 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:49:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12625 states. [2018-10-26 21:49:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12625 to 12625. [2018-10-26 21:49:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12625 states. [2018-10-26 21:49:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12625 states to 12625 states and 15157 transitions. [2018-10-26 21:49:21,366 INFO L78 Accepts]: Start accepts. Automaton has 12625 states and 15157 transitions. Word has length 217 [2018-10-26 21:49:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:49:21,366 INFO L481 AbstractCegarLoop]: Abstraction has 12625 states and 15157 transitions. [2018-10-26 21:49:21,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:49:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 12625 states and 15157 transitions. [2018-10-26 21:49:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-26 21:49:21,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:49:21,375 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:49:21,375 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:49:21,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:49:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1303721074, now seen corresponding path program 1 times [2018-10-26 21:49:21,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:49:21,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:49:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:21,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:49:21,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:49:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 103 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:49:21,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:49:21,912 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:49:21,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:49:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:49:22,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:49:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 103 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:49:22,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:49:22,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-26 21:49:22,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:49:22,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:49:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:49:22,384 INFO L87 Difference]: Start difference. First operand 12625 states and 15157 transitions. Second operand 7 states. [2018-10-26 21:49:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:49:38,371 INFO L93 Difference]: Finished difference Result 38559 states and 46711 transitions. [2018-10-26 21:49:38,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:49:38,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 276 [2018-10-26 21:49:38,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:49:38,422 INFO L225 Difference]: With dead ends: 38559 [2018-10-26 21:49:38,422 INFO L226 Difference]: Without dead ends: 22036 [2018-10-26 21:49:38,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:49:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22036 states. [2018-10-26 21:49:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22036 to 19434. [2018-10-26 21:49:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19434 states. [2018-10-26 21:49:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19434 states to 19434 states and 21868 transitions. [2018-10-26 21:49:38,820 INFO L78 Accepts]: Start accepts. Automaton has 19434 states and 21868 transitions. Word has length 276 [2018-10-26 21:49:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:49:38,821 INFO L481 AbstractCegarLoop]: Abstraction has 19434 states and 21868 transitions. [2018-10-26 21:49:38,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:49:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 19434 states and 21868 transitions. [2018-10-26 21:49:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-26 21:49:38,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:49:38,837 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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:49:38,837 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:49:38,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:49:38,838 INFO L82 PathProgramCache]: Analyzing trace with hash -130797006, now seen corresponding path program 1 times [2018-10-26 21:49:38,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:49:38,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:49:38,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:38,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:49:38,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:49:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-26 21:49:39,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:49:39,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:49:39,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:49:39,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:49:39,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:49:39,376 INFO L87 Difference]: Start difference. First operand 19434 states and 21868 transitions. Second operand 4 states. [2018-10-26 21:49:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:49:46,193 INFO L93 Difference]: Finished difference Result 46991 states and 53781 transitions. [2018-10-26 21:49:46,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:49:46,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2018-10-26 21:49:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:49:46,243 INFO L225 Difference]: With dead ends: 46991 [2018-10-26 21:49:46,243 INFO L226 Difference]: Without dead ends: 27988 [2018-10-26 21:49:46,265 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:49:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27988 states. [2018-10-26 21:49:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27988 to 23695. [2018-10-26 21:49:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23695 states. [2018-10-26 21:49:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23695 states to 23695 states and 26889 transitions. [2018-10-26 21:49:46,580 INFO L78 Accepts]: Start accepts. Automaton has 23695 states and 26889 transitions. Word has length 369 [2018-10-26 21:49:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:49:46,581 INFO L481 AbstractCegarLoop]: Abstraction has 23695 states and 26889 transitions. [2018-10-26 21:49:46,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:49:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 23695 states and 26889 transitions. [2018-10-26 21:49:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-26 21:49:46,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:49:46,597 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:49:46,597 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:49:46,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:49:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1045711102, now seen corresponding path program 1 times [2018-10-26 21:49:46,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:49:46,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:49:46,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:46,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:49:46,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:49:47,130 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2018-10-26 21:49:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-10-26 21:49:47,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:49:47,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:49:47,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:49:47,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:49:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:49:47,253 INFO L87 Difference]: Start difference. First operand 23695 states and 26889 transitions. Second operand 4 states. [2018-10-26 21:49:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:49:54,143 INFO L93 Difference]: Finished difference Result 80203 states and 90896 transitions. [2018-10-26 21:49:54,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:49:54,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2018-10-26 21:49:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:49:54,209 INFO L225 Difference]: With dead ends: 80203 [2018-10-26 21:49:54,209 INFO L226 Difference]: Without dead ends: 46225 [2018-10-26 21:49:54,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:49:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46225 states. [2018-10-26 21:49:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46225 to 44514. [2018-10-26 21:49:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44514 states. [2018-10-26 21:49:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44514 states to 44514 states and 48320 transitions. [2018-10-26 21:49:54,763 INFO L78 Accepts]: Start accepts. Automaton has 44514 states and 48320 transitions. Word has length 386 [2018-10-26 21:49:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:49:54,764 INFO L481 AbstractCegarLoop]: Abstraction has 44514 states and 48320 transitions. [2018-10-26 21:49:54,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:49:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 44514 states and 48320 transitions. [2018-10-26 21:49:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-26 21:49:54,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:49:54,778 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:54,779 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:49:54,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:49:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1524914977, now seen corresponding path program 1 times [2018-10-26 21:49:54,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:49:54,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:49:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:54,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:49:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:49:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:49:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-26 21:49:55,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:49:55,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:49:55,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:49:55,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:49:55,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:49:55,082 INFO L87 Difference]: Start difference. First operand 44514 states and 48320 transitions. Second operand 3 states. [2018-10-26 21:49:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:49:58,942 INFO L93 Difference]: Finished difference Result 92854 states and 100704 transitions. [2018-10-26 21:49:58,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:49:58,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 407 [2018-10-26 21:49:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:49:59,004 INFO L225 Difference]: With dead ends: 92854 [2018-10-26 21:49:59,004 INFO L226 Difference]: Without dead ends: 48768 [2018-10-26 21:49:59,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:49:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48768 states. [2018-10-26 21:49:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48768 to 42782. [2018-10-26 21:49:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42782 states. [2018-10-26 21:50:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42782 states to 42782 states and 46426 transitions. [2018-10-26 21:50:00,149 INFO L78 Accepts]: Start accepts. Automaton has 42782 states and 46426 transitions. Word has length 407 [2018-10-26 21:50:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:00,150 INFO L481 AbstractCegarLoop]: Abstraction has 42782 states and 46426 transitions. [2018-10-26 21:50:00,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 42782 states and 46426 transitions. [2018-10-26 21:50:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-26 21:50:00,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:00,176 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:50:00,176 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:00,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:00,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1205774582, now seen corresponding path program 1 times [2018-10-26 21:50:00,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:00,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:00,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:00,859 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-10-26 21:50:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 437 proven. 83 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-10-26 21:50:01,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:50:01,126 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:50:01,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:01,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:50:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 437 proven. 83 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-10-26 21:50:01,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:50:01,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-26 21:50:01,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:50:01,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:50:01,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:50:01,772 INFO L87 Difference]: Start difference. First operand 42782 states and 46426 transitions. Second operand 7 states. [2018-10-26 21:50:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:10,575 INFO L93 Difference]: Finished difference Result 88979 states and 96393 transitions. [2018-10-26 21:50:10,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:50:10,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 438 [2018-10-26 21:50:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:10,626 INFO L225 Difference]: With dead ends: 88979 [2018-10-26 21:50:10,626 INFO L226 Difference]: Without dead ends: 46626 [2018-10-26 21:50:10,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 436 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:50:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46626 states. [2018-10-26 21:50:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46626 to 44912. [2018-10-26 21:50:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44912 states. [2018-10-26 21:50:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44912 states to 44912 states and 48633 transitions. [2018-10-26 21:50:11,534 INFO L78 Accepts]: Start accepts. Automaton has 44912 states and 48633 transitions. Word has length 438 [2018-10-26 21:50:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:11,535 INFO L481 AbstractCegarLoop]: Abstraction has 44912 states and 48633 transitions. [2018-10-26 21:50:11,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:50:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 44912 states and 48633 transitions. [2018-10-26 21:50:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-10-26 21:50:11,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:11,552 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-26 21:50:11,553 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:11,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:11,553 INFO L82 PathProgramCache]: Analyzing trace with hash -595009748, now seen corresponding path program 1 times [2018-10-26 21:50:11,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:11,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:11,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:11,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:11,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:12,052 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-26 21:50:12,331 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 21:50:12,704 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-10-26 21:50:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 0 proven. 673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:50:13,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:50:13,767 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:50:13,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:13,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:50:14,911 WARN L179 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 19 [2018-10-26 21:50:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-10-26 21:50:15,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:50:15,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 15 [2018-10-26 21:50:15,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 21:50:15,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 21:50:15,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:50:15,702 INFO L87 Difference]: Start difference. First operand 44912 states and 48633 transitions. Second operand 15 states. [2018-10-26 21:51:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:51:17,017 INFO L93 Difference]: Finished difference Result 132602 states and 143919 transitions. [2018-10-26 21:51:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 21:51:17,017 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 465 [2018-10-26 21:51:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:51:17,089 INFO L225 Difference]: With dead ends: 132602 [2018-10-26 21:51:17,090 INFO L226 Difference]: Without dead ends: 79562 [2018-10-26 21:51:17,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 479 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=271, Invalid=919, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 21:51:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79562 states. [2018-10-26 21:51:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79562 to 65378. [2018-10-26 21:51:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65378 states. [2018-10-26 21:51:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65378 states to 65378 states and 69538 transitions. [2018-10-26 21:51:17,701 INFO L78 Accepts]: Start accepts. Automaton has 65378 states and 69538 transitions. Word has length 465 [2018-10-26 21:51:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:51:17,701 INFO L481 AbstractCegarLoop]: Abstraction has 65378 states and 69538 transitions. [2018-10-26 21:51:17,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 21:51:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 65378 states and 69538 transitions. [2018-10-26 21:51:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2018-10-26 21:51:17,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:51:17,720 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:17,720 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:51:17,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:51:17,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1470542092, now seen corresponding path program 1 times [2018-10-26 21:51:17,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:51:17,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:51:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:51:17,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:51:17,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:51:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:51:18,524 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 21:51:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 281 proven. 83 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 21:51:19,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:51:19,074 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:51:19,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:51:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:51:19,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:51:21,483 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~a21~0 127))) (or (and (exists ((v_prenex_39 Int)) (let ((.cse1 (* 9 v_prenex_39))) (let ((.cse0 (div .cse1 10))) (and (= 0 (mod .cse0 5)) (= 0 (mod (+ .cse0 1) 5)) (<= c_~a28~0 (+ (div .cse0 5) 307707)) (<= (+ v_prenex_39 588903) 0) (= 0 (mod .cse1 10)))))) .cse2) (and .cse2 (exists ((v_prenex_43 Int)) (let ((.cse4 (* 9 v_prenex_43))) (let ((.cse3 (div .cse4 10))) (and (not (= 0 (mod .cse3 5))) (< .cse3 0) (= 0 (mod .cse4 10)) (<= c_~a28~0 (+ (div .cse3 5) 307708)) (<= (+ v_prenex_43 588903) 0) (<= 0 (+ .cse3 1))))))) (and (exists ((v_~a28~0_1302 Int)) (let ((.cse6 (* 9 v_~a28~0_1302))) (let ((.cse5 (div .cse6 10))) (and (<= 0 (+ .cse5 1)) (< .cse5 0) (<= c_~a28~0 (+ (div .cse5 5) 307708)) (not (= 0 (mod .cse5 5))) (<= 0 .cse6) (<= (+ v_~a28~0_1302 588903) 0))))) .cse2) (and (exists ((v_prenex_50 Int)) (let ((.cse7 (* 9 v_prenex_50))) (let ((.cse9 (div .cse7 10))) (let ((.cse8 (+ .cse9 1))) (and (< .cse7 0) (= 0 (mod .cse8 5)) (<= (+ v_prenex_50 588903) 0) (= 0 (mod .cse9 5)) (not (= 0 (mod .cse7 10))) (<= c_~a28~0 (+ (div .cse8 5) 307707))))))) .cse2) (and (exists ((v_prenex_35 Int)) (let ((.cse11 (* 9 v_prenex_35))) (let ((.cse10 (div .cse11 10))) (let ((.cse12 (+ .cse10 1))) (and (<= (+ v_prenex_35 588903) 0) (<= c_~a28~0 (+ (div .cse10 5) 307707)) (= 0 (mod .cse11 10)) (< .cse12 0) (not (= 0 (mod .cse12 5))) (= 0 (mod .cse10 5))))))) .cse2) (and (exists ((v_prenex_45 Int)) (let ((.cse13 (* 9 v_prenex_45))) (let ((.cse14 (div .cse13 10))) (let ((.cse15 (+ .cse14 1))) (and (< .cse13 0) (not (= 0 (mod .cse14 5))) (not (= 0 (mod .cse13 10))) (= 0 (mod .cse15 5)) (<= (+ v_prenex_45 588903) 0) (< .cse14 0) (<= c_~a28~0 (+ (div .cse15 5) 307707))))))) .cse2) (and (exists ((v_prenex_42 Int)) (let ((.cse17 (* 9 v_prenex_42))) (let ((.cse18 (div .cse17 10))) (let ((.cse16 (+ .cse18 1))) (and (<= c_~a28~0 (+ (div .cse16 5) 307708)) (not (= 0 (mod .cse17 10))) (<= (+ v_prenex_42 588903) 0) (< .cse17 0) (not (= 0 (mod .cse16 5))) (not (= 0 (mod .cse18 5))) (< .cse16 0) (< .cse18 0)))))) .cse2) (and (exists ((v_prenex_31 Int)) (let ((.cse20 (* 9 v_prenex_31))) (let ((.cse21 (div .cse20 10))) (let ((.cse19 (+ .cse21 1))) (and (<= (+ v_prenex_31 588903) 0) (<= c_~a28~0 (+ (div .cse19 5) 307708)) (< .cse20 0) (not (= 0 (mod .cse20 10))) (< .cse19 0) (= 0 (mod .cse21 5)) (not (= 0 (mod .cse19 5)))))))) .cse2) (and (exists ((v_prenex_49 Int)) (let ((.cse23 (* 9 v_prenex_49))) (let ((.cse22 (div .cse23 10))) (and (<= c_~a28~0 (+ (div .cse22 5) 307707)) (<= 0 .cse23) (= 0 (mod (+ .cse22 1) 5)) (= 0 (mod .cse22 5)) (<= (+ v_prenex_49 588903) 0))))) .cse2) (and (exists ((v_prenex_29 Int)) (let ((.cse25 (* 9 v_prenex_29))) (let ((.cse24 (div .cse25 10))) (let ((.cse26 (+ .cse24 1))) (and (<= (+ v_prenex_29 588903) 0) (not (= 0 (mod .cse24 5))) (< .cse24 0) (not (= 0 (mod .cse25 10))) (<= c_~a28~0 (+ (div .cse26 5) 307707)) (<= 0 .cse26) (< .cse25 0)))))) .cse2) (and .cse2 (exists ((v_prenex_33 Int)) (let ((.cse28 (* 9 v_prenex_33))) (let ((.cse29 (div .cse28 10))) (let ((.cse27 (+ .cse29 1))) (and (< .cse27 0) (not (= 0 (mod .cse28 10))) (not (= 0 (mod .cse27 5))) (<= (+ v_prenex_33 588903) 0) (< .cse28 0) (<= c_~a28~0 (+ (div .cse27 5) 307708)) (<= 0 .cse29))))))) (and (exists ((v_prenex_28 Int)) (let ((.cse31 (* 9 v_prenex_28))) (let ((.cse30 (div .cse31 10))) (and (<= 0 .cse30) (<= 0 (+ .cse30 1)) (<= 0 .cse31) (<= c_~a28~0 (+ (div .cse30 5) 307707)) (<= (+ v_prenex_28 588903) 0))))) .cse2) (and .cse2 (exists ((v_prenex_47 Int)) (let ((.cse33 (* 9 v_prenex_47))) (let ((.cse32 (div .cse33 10))) (and (not (= 0 (mod .cse32 5))) (<= 0 .cse33) (<= (+ v_prenex_47 588903) 0) (<= c_~a28~0 (+ (div .cse32 5) 307708)) (= 0 (mod (+ .cse32 1) 5)) (< .cse32 0)))))) (and .cse2 (exists ((v_prenex_30 Int)) (let ((.cse36 (* 9 v_prenex_30))) (let ((.cse34 (div .cse36 10))) (let ((.cse35 (+ .cse34 1))) (and (not (= 0 (mod .cse34 5))) (< .cse35 0) (<= (+ v_prenex_30 588903) 0) (= 0 (mod .cse36 10)) (< .cse34 0) (not (= 0 (mod .cse35 5))) (<= c_~a28~0 (+ (div .cse34 5) 307708)))))))) (and (exists ((v_prenex_48 Int)) (let ((.cse39 (* 9 v_prenex_48))) (let ((.cse38 (div .cse39 10))) (let ((.cse37 (+ .cse38 1))) (and (not (= 0 (mod .cse37 5))) (<= 0 .cse38) (= 0 (mod .cse39 10)) (<= c_~a28~0 (+ (div .cse38 5) 307707)) (< .cse37 0) (<= (+ v_prenex_48 588903) 0)))))) .cse2) (and (exists ((v_prenex_44 Int)) (let ((.cse41 (* 9 v_prenex_44))) (let ((.cse40 (div .cse41 10))) (and (< .cse40 0) (= 0 (mod (+ .cse40 1) 5)) (<= c_~a28~0 (+ (div .cse40 5) 307708)) (not (= 0 (mod .cse40 5))) (= 0 (mod .cse41 10)) (<= (+ v_prenex_44 588903) 0))))) .cse2) (and (exists ((v_prenex_40 Int)) (let ((.cse43 (* 9 v_prenex_40))) (let ((.cse44 (div .cse43 10))) (let ((.cse42 (+ .cse44 1))) (and (< .cse42 0) (<= 0 .cse43) (not (= 0 (mod .cse42 5))) (= 0 (mod .cse44 5)) (<= (+ v_prenex_40 588903) 0) (<= c_~a28~0 (+ (div .cse44 5) 307707))))))) .cse2) (and .cse2 (exists ((v_prenex_41 Int)) (let ((.cse45 (* 9 v_prenex_41))) (let ((.cse46 (div .cse45 10))) (and (= 0 (mod .cse45 10)) (= 0 (mod .cse46 5)) (<= (+ v_prenex_41 588903) 0) (<= 0 (+ .cse46 1)) (<= c_~a28~0 (+ (div .cse46 5) 307707))))))) (and (exists ((v_prenex_32 Int)) (let ((.cse48 (* 9 v_prenex_32))) (let ((.cse49 (div .cse48 10))) (let ((.cse47 (+ .cse49 1))) (and (< .cse47 0) (not (= 0 (mod .cse47 5))) (<= 0 .cse48) (<= (+ v_prenex_32 588903) 0) (<= 0 .cse49) (<= c_~a28~0 (+ (div .cse49 5) 307707))))))) .cse2) (and (exists ((v_prenex_36 Int)) (let ((.cse50 (* 9 v_prenex_36))) (let ((.cse51 (div .cse50 10))) (and (= 0 (mod .cse50 10)) (<= c_~a28~0 (+ (div .cse51 5) 307707)) (<= 0 .cse51) (<= (+ v_prenex_36 588903) 0) (= 0 (mod (+ .cse51 1) 5)))))) .cse2) (and (exists ((v_prenex_27 Int)) (let ((.cse53 (* 9 v_prenex_27))) (let ((.cse52 (div .cse53 10))) (and (<= 0 (+ .cse52 1)) (<= 0 .cse52) (= 0 (mod .cse53 10)) (<= (+ v_prenex_27 588903) 0) (<= c_~a28~0 (+ (div .cse52 5) 307707)))))) .cse2) (and (exists ((v_prenex_34 Int)) (let ((.cse54 (* 9 v_prenex_34))) (let ((.cse56 (div .cse54 10))) (let ((.cse55 (+ .cse56 1))) (and (< .cse54 0) (<= c_~a28~0 (+ (div .cse55 5) 307707)) (<= 0 .cse55) (<= (+ v_prenex_34 588903) 0) (<= 0 .cse56) (not (= 0 (mod .cse54 10)))))))) .cse2) (and (exists ((v_prenex_37 Int)) (let ((.cse59 (* 9 v_prenex_37))) (let ((.cse57 (div .cse59 10))) (let ((.cse58 (+ .cse57 1))) (and (<= 0 .cse57) (= 0 (mod .cse58 5)) (<= c_~a28~0 (+ (div .cse58 5) 307707)) (not (= 0 (mod .cse59 10))) (<= (+ v_prenex_37 588903) 0) (< .cse59 0)))))) .cse2) (and (exists ((v_prenex_38 Int)) (let ((.cse60 (* 9 v_prenex_38))) (let ((.cse61 (div .cse60 10))) (let ((.cse62 (+ .cse61 1))) (and (not (= 0 (mod .cse60 10))) (= 0 (mod .cse61 5)) (<= 0 .cse62) (<= (+ v_prenex_38 588903) 0) (< .cse60 0) (<= c_~a28~0 (+ (div .cse62 5) 307707))))))) .cse2) (and (exists ((v_prenex_51 Int)) (let ((.cse65 (* 9 v_prenex_51))) (let ((.cse63 (div .cse65 10))) (let ((.cse64 (+ .cse63 1))) (and (<= c_~a28~0 (+ (div .cse63 5) 307708)) (not (= 0 (mod .cse63 5))) (< .cse63 0) (not (= 0 (mod .cse64 5))) (<= (+ v_prenex_51 588903) 0) (< .cse64 0) (<= 0 .cse65)))))) .cse2) (and (exists ((v_prenex_52 Int)) (let ((.cse66 (* 9 v_prenex_52))) (let ((.cse67 (div .cse66 10))) (and (<= 0 .cse66) (= 0 (mod (+ .cse67 1) 5)) (<= (+ v_prenex_52 588903) 0) (<= c_~a28~0 (+ (div .cse67 5) 307707)) (<= 0 .cse67))))) .cse2) (and (exists ((v_prenex_46 Int)) (let ((.cse69 (* 9 v_prenex_46))) (let ((.cse68 (div .cse69 10))) (and (<= c_~a28~0 (+ (div .cse68 5) 307707)) (<= 0 .cse69) (= 0 (mod .cse68 5)) (<= (+ v_prenex_46 588903) 0) (<= 0 (+ .cse68 1)))))) .cse2))) is different from false [2018-10-26 21:51:26,034 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~a24~0 1)) (.cse3 (<= c_~a21~0 127)) (.cse4 (<= (+ c_~a14~0 182) 0))) (or (and (exists ((v_~a28~0_1302 Int)) (let ((.cse1 (* 9 v_~a28~0_1302))) (let ((.cse0 (div .cse1 10))) (and (<= 0 (+ .cse0 1)) (<= (+ c_~a28~0 292304) (div .cse0 5)) (< .cse0 0) (not (= 0 (mod .cse0 5))) (<= 0 .cse1) (<= (+ v_~a28~0_1302 588903) 0))))) .cse2 .cse3 .cse4) (and .cse2 .cse3 (exists ((v_prenex_43 Int)) (let ((.cse6 (* 9 v_prenex_43))) (let ((.cse5 (div .cse6 10))) (and (not (= 0 (mod .cse5 5))) (< .cse5 0) (= 0 (mod .cse6 10)) (<= (+ c_~a28~0 292304) (div .cse5 5)) (<= (+ v_prenex_43 588903) 0) (<= 0 (+ .cse5 1)))))) .cse4) (and (exists ((v_prenex_34 Int)) (let ((.cse8 (* 9 v_prenex_34))) (let ((.cse9 (div .cse8 10))) (let ((.cse7 (+ .cse9 1))) (and (<= (+ c_~a28~0 292305) (div .cse7 5)) (< .cse8 0) (<= 0 .cse7) (<= (+ v_prenex_34 588903) 0) (<= 0 .cse9) (not (= 0 (mod .cse8 10)))))))) .cse2 .cse3 .cse4) (and .cse2 (exists ((v_prenex_31 Int)) (let ((.cse10 (* 9 v_prenex_31))) (let ((.cse12 (div .cse10 10))) (let ((.cse11 (+ .cse12 1))) (and (<= (+ v_prenex_31 588903) 0) (< .cse10 0) (not (= 0 (mod .cse10 10))) (< .cse11 0) (= 0 (mod .cse12 5)) (<= (+ c_~a28~0 292304) (div .cse11 5)) (not (= 0 (mod .cse11 5)))))))) .cse3 .cse4) (and .cse2 (exists ((v_prenex_39 Int)) (let ((.cse14 (* 9 v_prenex_39))) (let ((.cse13 (div .cse14 10))) (and (= 0 (mod .cse13 5)) (= 0 (mod (+ .cse13 1) 5)) (<= (+ c_~a28~0 292305) (div .cse13 5)) (<= (+ v_prenex_39 588903) 0) (= 0 (mod .cse14 10)))))) .cse3 .cse4) (and (exists ((v_prenex_37 Int)) (let ((.cse17 (* 9 v_prenex_37))) (let ((.cse15 (div .cse17 10))) (let ((.cse16 (+ .cse15 1))) (and (<= 0 .cse15) (<= (+ c_~a28~0 292305) (div .cse16 5)) (= 0 (mod .cse16 5)) (not (= 0 (mod .cse17 10))) (<= (+ v_prenex_37 588903) 0) (< .cse17 0)))))) .cse2 .cse3 .cse4) (and (exists ((v_prenex_49 Int)) (let ((.cse18 (* 9 v_prenex_49))) (let ((.cse19 (div .cse18 10))) (and (<= 0 .cse18) (= 0 (mod (+ .cse19 1) 5)) (= 0 (mod .cse19 5)) (<= (+ v_prenex_49 588903) 0) (<= (+ c_~a28~0 292305) (div .cse19 5)))))) .cse2 .cse3 .cse4) (and (exists ((v_prenex_41 Int)) (let ((.cse21 (* 9 v_prenex_41))) (let ((.cse20 (div .cse21 10))) (and (<= (+ c_~a28~0 292305) (div .cse20 5)) (= 0 (mod .cse21 10)) (= 0 (mod .cse20 5)) (<= (+ v_prenex_41 588903) 0) (<= 0 (+ .cse20 1)))))) .cse2 .cse3 .cse4) (and (exists ((v_prenex_32 Int)) (let ((.cse24 (* 9 v_prenex_32))) (let ((.cse23 (div .cse24 10))) (let ((.cse22 (+ .cse23 1))) (and (< .cse22 0) (<= (+ c_~a28~0 292305) (div .cse23 5)) (not (= 0 (mod .cse22 5))) (<= 0 .cse24) (<= (+ v_prenex_32 588903) 0) (<= 0 .cse23)))))) .cse2 .cse3 .cse4) (and (exists ((v_prenex_47 Int)) (let ((.cse26 (* 9 v_prenex_47))) (let ((.cse25 (div .cse26 10))) (and (not (= 0 (mod .cse25 5))) (<= 0 .cse26) (<= (+ v_prenex_47 588903) 0) (<= (+ c_~a28~0 292304) (div .cse25 5)) (= 0 (mod (+ .cse25 1) 5)) (< .cse25 0))))) .cse2 .cse3 .cse4) (and .cse2 (exists ((v_prenex_36 Int)) (let ((.cse27 (* 9 v_prenex_36))) (let ((.cse28 (div .cse27 10))) (and (= 0 (mod .cse27 10)) (<= 0 .cse28) (<= (+ v_prenex_36 588903) 0) (<= (+ c_~a28~0 292305) (div .cse28 5)) (= 0 (mod (+ .cse28 1) 5)))))) .cse3 .cse4) (and .cse2 (exists ((v_prenex_51 Int)) (let ((.cse31 (* 9 v_prenex_51))) (let ((.cse29 (div .cse31 10))) (let ((.cse30 (+ .cse29 1))) (and (not (= 0 (mod .cse29 5))) (< .cse29 0) (not (= 0 (mod .cse30 5))) (<= (+ c_~a28~0 292304) (div .cse29 5)) (<= (+ v_prenex_51 588903) 0) (< .cse30 0) (<= 0 .cse31)))))) .cse3 .cse4) (and (exists ((v_prenex_44 Int)) (let ((.cse33 (* 9 v_prenex_44))) (let ((.cse32 (div .cse33 10))) (and (<= (+ c_~a28~0 292304) (div .cse32 5)) (< .cse32 0) (= 0 (mod (+ .cse32 1) 5)) (not (= 0 (mod .cse32 5))) (= 0 (mod .cse33 10)) (<= (+ v_prenex_44 588903) 0))))) .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse4 (exists ((v_prenex_33 Int)) (let ((.cse35 (* 9 v_prenex_33))) (let ((.cse36 (div .cse35 10))) (let ((.cse34 (+ .cse36 1))) (and (< .cse34 0) (<= (+ c_~a28~0 292304) (div .cse34 5)) (not (= 0 (mod .cse35 10))) (not (= 0 (mod .cse34 5))) (<= (+ v_prenex_33 588903) 0) (< .cse35 0) (<= 0 .cse36))))))) (and .cse2 (exists ((v_prenex_40 Int)) (let ((.cse39 (* 9 v_prenex_40))) (let ((.cse38 (div .cse39 10))) (let ((.cse37 (+ .cse38 1))) (and (< .cse37 0) (<= (+ c_~a28~0 292305) (div .cse38 5)) (<= 0 .cse39) (not (= 0 (mod .cse37 5))) (= 0 (mod .cse38 5)) (<= (+ v_prenex_40 588903) 0)))))) .cse3 .cse4) (and .cse2 (exists ((v_prenex_50 Int)) (let ((.cse40 (* 9 v_prenex_50))) (let ((.cse42 (div .cse40 10))) (let ((.cse41 (+ .cse42 1))) (and (< .cse40 0) (= 0 (mod .cse41 5)) (<= (+ v_prenex_50 588903) 0) (= 0 (mod .cse42 5)) (<= (+ c_~a28~0 292305) (div .cse41 5)) (not (= 0 (mod .cse40 10)))))))) .cse3 .cse4) (and .cse2 (exists ((v_prenex_48 Int)) (let ((.cse45 (* 9 v_prenex_48))) (let ((.cse44 (div .cse45 10))) (let ((.cse43 (+ .cse44 1))) (and (not (= 0 (mod .cse43 5))) (<= 0 .cse44) (= 0 (mod .cse45 10)) (<= (+ c_~a28~0 292305) (div .cse44 5)) (< .cse43 0) (<= (+ v_prenex_48 588903) 0)))))) .cse3 .cse4) (and .cse2 (exists ((v_prenex_28 Int)) (let ((.cse47 (* 9 v_prenex_28))) (let ((.cse46 (div .cse47 10))) (and (<= 0 .cse46) (<= 0 (+ .cse46 1)) (<= (+ c_~a28~0 292305) (div .cse46 5)) (<= 0 .cse47) (<= (+ v_prenex_28 588903) 0))))) .cse3 .cse4) (and .cse2 (exists ((v_prenex_52 Int)) (let ((.cse49 (* 9 v_prenex_52))) (let ((.cse48 (div .cse49 10))) (and (<= (+ c_~a28~0 292305) (div .cse48 5)) (<= 0 .cse49) (= 0 (mod (+ .cse48 1) 5)) (<= (+ v_prenex_52 588903) 0) (<= 0 .cse48))))) .cse3 .cse4) (and (exists ((v_prenex_35 Int)) (let ((.cse50 (* 9 v_prenex_35))) (let ((.cse52 (div .cse50 10))) (let ((.cse51 (+ .cse52 1))) (and (<= (+ v_prenex_35 588903) 0) (= 0 (mod .cse50 10)) (< .cse51 0) (not (= 0 (mod .cse51 5))) (<= (+ c_~a28~0 292305) (div .cse52 5)) (= 0 (mod .cse52 5))))))) .cse2 .cse3 .cse4) (and (exists ((v_prenex_27 Int)) (let ((.cse54 (* 9 v_prenex_27))) (let ((.cse53 (div .cse54 10))) (and (<= 0 (+ .cse53 1)) (<= 0 .cse53) (= 0 (mod .cse54 10)) (<= (+ v_prenex_27 588903) 0) (<= (+ c_~a28~0 292305) (div .cse53 5)))))) .cse2 .cse3 .cse4) (and (exists ((v_prenex_38 Int)) (let ((.cse55 (* 9 v_prenex_38))) (let ((.cse56 (div .cse55 10))) (let ((.cse57 (+ .cse56 1))) (and (not (= 0 (mod .cse55 10))) (= 0 (mod .cse56 5)) (<= 0 .cse57) (<= (+ v_prenex_38 588903) 0) (< .cse55 0) (<= (+ c_~a28~0 292305) (div .cse57 5))))))) .cse2 .cse3 .cse4) (and .cse2 (exists ((v_prenex_45 Int)) (let ((.cse58 (* 9 v_prenex_45))) (let ((.cse59 (div .cse58 10))) (let ((.cse60 (+ .cse59 1))) (and (< .cse58 0) (not (= 0 (mod .cse59 5))) (<= (+ c_~a28~0 292305) (div .cse60 5)) (not (= 0 (mod .cse58 10))) (= 0 (mod .cse60 5)) (<= (+ v_prenex_45 588903) 0) (< .cse59 0)))))) .cse3 .cse4) (and .cse2 (exists ((v_prenex_30 Int)) (let ((.cse63 (* 9 v_prenex_30))) (let ((.cse61 (div .cse63 10))) (let ((.cse62 (+ .cse61 1))) (and (<= (+ c_~a28~0 292304) (div .cse61 5)) (not (= 0 (mod .cse61 5))) (< .cse62 0) (<= (+ v_prenex_30 588903) 0) (= 0 (mod .cse63 10)) (< .cse61 0) (not (= 0 (mod .cse62 5)))))))) .cse3 .cse4) (and .cse2 .cse3 (exists ((v_prenex_46 Int)) (let ((.cse65 (* 9 v_prenex_46))) (let ((.cse64 (div .cse65 10))) (and (<= (+ c_~a28~0 292305) (div .cse64 5)) (<= 0 .cse65) (= 0 (mod .cse64 5)) (<= (+ v_prenex_46 588903) 0) (<= 0 (+ .cse64 1)))))) .cse4) (and .cse2 (exists ((v_prenex_42 Int)) (let ((.cse66 (* 9 v_prenex_42))) (let ((.cse68 (div .cse66 10))) (let ((.cse67 (+ .cse68 1))) (and (not (= 0 (mod .cse66 10))) (<= (+ v_prenex_42 588903) 0) (< .cse66 0) (<= (+ c_~a28~0 292304) (div .cse67 5)) (not (= 0 (mod .cse67 5))) (not (= 0 (mod .cse68 5))) (< .cse67 0) (< .cse68 0)))))) .cse3 .cse4) (and (exists ((v_prenex_29 Int)) (let ((.cse71 (* 9 v_prenex_29))) (let ((.cse70 (div .cse71 10))) (let ((.cse69 (+ .cse70 1))) (and (<= (+ c_~a28~0 292305) (div .cse69 5)) (<= (+ v_prenex_29 588903) 0) (not (= 0 (mod .cse70 5))) (< .cse70 0) (not (= 0 (mod .cse71 10))) (<= 0 .cse69) (< .cse71 0)))))) .cse2 .cse3 .cse4))) is different from false [2018-10-26 21:51:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 285 not checked. [2018-10-26 21:51:41,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:51:41,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2018-10-26 21:51:41,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:51:41,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:51:41,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=55, Unknown=2, NotChecked=30, Total=110 [2018-10-26 21:51:41,933 INFO L87 Difference]: Start difference. First operand 65378 states and 69538 transitions. Second operand 11 states. [2018-10-26 21:51:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:51:57,949 INFO L93 Difference]: Finished difference Result 133744 states and 142198 transitions. [2018-10-26 21:51:57,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:51:57,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 548 [2018-10-26 21:51:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:51:58,031 INFO L225 Difference]: With dead ends: 133744 [2018-10-26 21:51:58,032 INFO L226 Difference]: Without dead ends: 68368 [2018-10-26 21:51:58,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2018-10-26 21:51:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68368 states. [2018-10-26 21:51:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68368 to 66232. [2018-10-26 21:51:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66232 states. [2018-10-26 21:51:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66232 states to 66232 states and 70405 transitions. [2018-10-26 21:51:58,631 INFO L78 Accepts]: Start accepts. Automaton has 66232 states and 70405 transitions. Word has length 548 [2018-10-26 21:51:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:51:58,632 INFO L481 AbstractCegarLoop]: Abstraction has 66232 states and 70405 transitions. [2018-10-26 21:51:58,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:51:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 66232 states and 70405 transitions. [2018-10-26 21:51:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-10-26 21:51:58,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:51:58,642 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:51:58,642 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:51:58,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:51:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash 623406777, now seen corresponding path program 1 times [2018-10-26 21:51:58,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:51:58,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:51:58,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:51:58,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:51:58,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:51:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:52:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 79 proven. 594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:52:00,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:52:00,229 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:52:00,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:52:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:52:00,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:52:01,605 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2018-10-26 21:52:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 371 proven. 302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:52:03,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:52:03,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2018-10-26 21:52:03,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 21:52:03,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 21:52:03,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-10-26 21:52:03,128 INFO L87 Difference]: Start difference. First operand 66232 states and 70405 transitions. Second operand 18 states. [2018-10-26 21:52:15,608 WARN L179 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 Received shutdown request... [2018-10-26 21:52:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-26 21:52:21,893 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 21:52:21,898 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 21:52:21,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:52:21 BoogieIcfgContainer [2018-10-26 21:52:21,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:52:21,899 INFO L168 Benchmark]: Toolchain (without parser) took 236452.40 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 733.3 MB. Max. memory is 7.1 GB. [2018-10-26 21:52:21,900 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:52:21,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1525.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. [2018-10-26 21:52:21,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 540.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 791.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -917.4 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2018-10-26 21:52:21,902 INFO L168 Benchmark]: Boogie Preprocessor took 312.27 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:52:21,903 INFO L168 Benchmark]: RCFGBuilder took 10800.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 485.3 MB). Peak memory consumption was 485.3 MB. Max. memory is 7.1 GB. [2018-10-26 21:52:21,904 INFO L168 Benchmark]: TraceAbstraction took 223268.72 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 1.7 GB in the beginning and 3.1 GB in the end (delta: -1.4 GB). Peak memory consumption was 205.9 MB. Max. memory is 7.1 GB. [2018-10-26 21:52:21,908 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 1525.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Peak memory consumption was 140.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 540.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 791.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -917.4 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 312.27 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10800.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 485.3 MB). Peak memory consumption was 485.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223268.72 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 1.7 GB in the beginning and 3.1 GB in the end (delta: -1.4 GB). Peak memory consumption was 205.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 167]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 167). Cancelled while BasicCegarLoop was constructing difference of abstraction (66232states) and FLOYD_HOARE automaton (currently 41 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (13452 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 591 locations, 1 error locations. TIMEOUT Result, 223.1s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 179.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4562 SDtfs, 41457 SDslu, 3372 SDs, 0 SdLazy, 69589 SolverSat, 9040 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 155.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2463 GetRequests, 2331 SyntacticMatches, 4 SemanticMatches, 128 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66232occurred in iteration=11, 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: 5.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 32664 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 33.8s InterpolantComputationTime, 6324 NumberOfCodeBlocks, 6324 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6307 ConstructedInterpolants, 299 QuantifiedInterpolants, 127524325 SizeOfPredicates, 13 NumberOfNonLiveVariables, 2909 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 4666/7066 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown