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_label31_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:34:14,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:34:14,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:34:14,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:34:14,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:34:14,074 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:34:14,075 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:34:14,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:34:14,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:34:14,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:34:14,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:34:14,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:34:14,082 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:34:14,083 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:34:14,084 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:34:14,084 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:34:14,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:34:14,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:34:14,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:34:14,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:34:14,092 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:34:14,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:34:14,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:34:14,096 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:34:14,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:34:14,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:34:14,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:34:14,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:34:14,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:34:14,102 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:34:14,102 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:34:14,103 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:34:14,103 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:34:14,103 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:34:14,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:34:14,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:34:14,105 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 19:34:14,123 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:34:14,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:34:14,124 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:34:14,125 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:34:14,126 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:34:14,126 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:34:14,126 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:34:14,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:34:14,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:34:14,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:34:14,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:34:14,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:34:14,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:34:14,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:34:14,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:34:14,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:34:14,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:34:14,129 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:34:14,131 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:34:14,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:34:14,131 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:34:14,131 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:34:14,131 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:34:14,132 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:34:14,132 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:34:14,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:34:14,132 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:34:14,132 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:34:14,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:34:14,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:34:14,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:34:14,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:34:14,211 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:34:14,212 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label31_false-unreach-call.c [2018-10-26 19:34:14,276 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9dbeedde2/9aac27cfed6146568437a90925c8b20b/FLAG7e69613ec [2018-10-26 19:34:14,967 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:34:14,968 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label31_false-unreach-call.c [2018-10-26 19:34:14,990 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9dbeedde2/9aac27cfed6146568437a90925c8b20b/FLAG7e69613ec [2018-10-26 19:34:15,013 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9dbeedde2/9aac27cfed6146568437a90925c8b20b [2018-10-26 19:34:15,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:34:15,031 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:34:15,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:34:15,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:34:15,039 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:34:15,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:34:15" (1/1) ... [2018-10-26 19:34:15,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aea84ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:15, skipping insertion in model container [2018-10-26 19:34:15,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:34:15" (1/1) ... [2018-10-26 19:34:15,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:34:15,185 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:34:16,168 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:34:16,173 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:34:16,595 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:34:16,620 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:34:16,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16 WrapperNode [2018-10-26 19:34:16,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:34:16,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:34:16,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:34:16,622 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:34:16,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (1/1) ... [2018-10-26 19:34:16,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (1/1) ... [2018-10-26 19:34:17,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:34:17,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:34:17,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:34:17,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:34:17,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (1/1) ... [2018-10-26 19:34:17,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (1/1) ... [2018-10-26 19:34:17,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (1/1) ... [2018-10-26 19:34:17,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (1/1) ... [2018-10-26 19:34:17,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (1/1) ... [2018-10-26 19:34:17,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (1/1) ... [2018-10-26 19:34:17,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (1/1) ... [2018-10-26 19:34:17,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:34:17,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:34:17,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:34:17,408 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:34:17,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (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 19:34:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:34:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:34:17,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:34:26,516 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:34:26,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:34:26 BoogieIcfgContainer [2018-10-26 19:34:26,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:34:26,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:34:26,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:34:26,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:34:26,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:34:15" (1/3) ... [2018-10-26 19:34:26,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec3bff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:34:26, skipping insertion in model container [2018-10-26 19:34:26,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:34:16" (2/3) ... [2018-10-26 19:34:26,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec3bff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:34:26, skipping insertion in model container [2018-10-26 19:34:26,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:34:26" (3/3) ... [2018-10-26 19:34:26,527 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label31_false-unreach-call.c [2018-10-26 19:34:26,537 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:34:26,547 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:34:26,565 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:34:26,607 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:34:26,608 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:34:26,608 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:34:26,608 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:34:26,608 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:34:26,609 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:34:26,609 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:34:26,609 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:34:26,609 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:34:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-10-26 19:34:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 19:34:26,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:34:26,648 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:34:26,650 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:34:26,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:34:26,657 INFO L82 PathProgramCache]: Analyzing trace with hash 384191218, now seen corresponding path program 1 times [2018-10-26 19:34:26,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:34:26,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:34:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:34:26,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:34:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:27,033 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-26 19:34:27,036 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 19:34:27,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:34:27,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:34:27,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:34:27,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:34:27,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:34:27,064 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-10-26 19:34:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:34:41,253 INFO L93 Difference]: Finished difference Result 2102 states and 3914 transitions. [2018-10-26 19:34:41,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:34:41,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-10-26 19:34:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:34:41,293 INFO L225 Difference]: With dead ends: 2102 [2018-10-26 19:34:41,294 INFO L226 Difference]: Without dead ends: 1504 [2018-10-26 19:34:41,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:34:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2018-10-26 19:34:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1491. [2018-10-26 19:34:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2018-10-26 19:34:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2416 transitions. [2018-10-26 19:34:41,448 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2416 transitions. Word has length 9 [2018-10-26 19:34:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:34:41,448 INFO L481 AbstractCegarLoop]: Abstraction has 1491 states and 2416 transitions. [2018-10-26 19:34:41,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:34:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2416 transitions. [2018-10-26 19:34:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 19:34:41,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:34:41,453 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:34:41,454 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:34:41,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:34:41,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1516617785, now seen corresponding path program 1 times [2018-10-26 19:34:41,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:34:41,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:34:41,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:34:41,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:41,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:34:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:34:41,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:34:41,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:34:41,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:34:41,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:34:41,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:34:41,718 INFO L87 Difference]: Start difference. First operand 1491 states and 2416 transitions. Second operand 4 states. [2018-10-26 19:34:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:34:49,701 INFO L93 Difference]: Finished difference Result 4268 states and 6993 transitions. [2018-10-26 19:34:49,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:34:49,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-10-26 19:34:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:34:49,716 INFO L225 Difference]: With dead ends: 4268 [2018-10-26 19:34:49,716 INFO L226 Difference]: Without dead ends: 2779 [2018-10-26 19:34:49,721 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 19:34:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2779 states. [2018-10-26 19:34:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2779 to 2779. [2018-10-26 19:34:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2018-10-26 19:34:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3841 transitions. [2018-10-26 19:34:49,778 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3841 transitions. Word has length 77 [2018-10-26 19:34:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:34:49,779 INFO L481 AbstractCegarLoop]: Abstraction has 2779 states and 3841 transitions. [2018-10-26 19:34:49,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:34:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3841 transitions. [2018-10-26 19:34:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 19:34:49,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:34:49,782 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:34:49,782 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:34:49,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:34:49,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1284183802, now seen corresponding path program 1 times [2018-10-26 19:34:49,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:34:49,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:34:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:34:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:34:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:34:50,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:34:50,057 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 19:34:50,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:34:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:34:50,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:34:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:34:50,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:34:50,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-26 19:34:50,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:34:50,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:34:50,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:34:50,433 INFO L87 Difference]: Start difference. First operand 2779 states and 3841 transitions. Second operand 6 states. [2018-10-26 19:35:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:35:05,690 INFO L93 Difference]: Finished difference Result 13740 states and 18943 transitions. [2018-10-26 19:35:05,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:35:05,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-10-26 19:35:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:35:05,728 INFO L225 Difference]: With dead ends: 13740 [2018-10-26 19:35:05,728 INFO L226 Difference]: Without dead ends: 8329 [2018-10-26 19:35:05,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:35:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8329 states. [2018-10-26 19:35:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8329 to 8320. [2018-10-26 19:35:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8320 states. [2018-10-26 19:35:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 10083 transitions. [2018-10-26 19:35:05,884 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 10083 transitions. Word has length 80 [2018-10-26 19:35:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:35:05,885 INFO L481 AbstractCegarLoop]: Abstraction has 8320 states and 10083 transitions. [2018-10-26 19:35:05,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:35:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 10083 transitions. [2018-10-26 19:35:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-26 19:35:05,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:35:05,891 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:35:05,891 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:35:05,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:35:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash 373425507, now seen corresponding path program 1 times [2018-10-26 19:35:05,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:35:05,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:35:05,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:05,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:05,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:35:06,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:35:06,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:35:06,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:35:06,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:35:06,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:35:06,087 INFO L87 Difference]: Start difference. First operand 8320 states and 10083 transitions. Second operand 3 states. [2018-10-26 19:35:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:35:10,023 INFO L93 Difference]: Finished difference Result 20900 states and 25916 transitions. [2018-10-26 19:35:10,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:35:10,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-10-26 19:35:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:35:10,069 INFO L225 Difference]: With dead ends: 20900 [2018-10-26 19:35:10,070 INFO L226 Difference]: Without dead ends: 13009 [2018-10-26 19:35:10,080 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 19:35:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13009 states. [2018-10-26 19:35:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13009 to 13009. [2018-10-26 19:35:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13009 states. [2018-10-26 19:35:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13009 states to 13009 states and 15403 transitions. [2018-10-26 19:35:10,307 INFO L78 Accepts]: Start accepts. Automaton has 13009 states and 15403 transitions. Word has length 159 [2018-10-26 19:35:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:35:10,308 INFO L481 AbstractCegarLoop]: Abstraction has 13009 states and 15403 transitions. [2018-10-26 19:35:10,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:35:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 13009 states and 15403 transitions. [2018-10-26 19:35:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-26 19:35:10,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:35:10,320 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:35:10,321 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:35:10,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:35:10,321 INFO L82 PathProgramCache]: Analyzing trace with hash 450877180, now seen corresponding path program 1 times [2018-10-26 19:35:10,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:35:10,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:35:10,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:10,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 297 proven. 83 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 19:35:11,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:35:11,028 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 19:35:11,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:11,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:35:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 297 proven. 83 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 19:35:11,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:35:11,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-26 19:35:11,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:35:11,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:35:11,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:35:11,447 INFO L87 Difference]: Start difference. First operand 13009 states and 15403 transitions. Second operand 7 states. [2018-10-26 19:35:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:35:29,823 INFO L93 Difference]: Finished difference Result 39288 states and 46523 transitions. [2018-10-26 19:35:29,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:35:29,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 335 [2018-10-26 19:35:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:35:29,876 INFO L225 Difference]: With dead ends: 39288 [2018-10-26 19:35:29,876 INFO L226 Difference]: Without dead ends: 24533 [2018-10-26 19:35:29,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:35:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24533 states. [2018-10-26 19:35:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24533 to 21501. [2018-10-26 19:35:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21501 states. [2018-10-26 19:35:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21501 states to 21501 states and 24272 transitions. [2018-10-26 19:35:30,175 INFO L78 Accepts]: Start accepts. Automaton has 21501 states and 24272 transitions. Word has length 335 [2018-10-26 19:35:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:35:30,176 INFO L481 AbstractCegarLoop]: Abstraction has 21501 states and 24272 transitions. [2018-10-26 19:35:30,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:35:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21501 states and 24272 transitions. [2018-10-26 19:35:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-26 19:35:30,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:35:30,183 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:35:30,185 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:35:30,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:35:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash 211741069, now seen corresponding path program 1 times [2018-10-26 19:35:30,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:35:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:35:30,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:30,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:30,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-26 19:35:30,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:35:30,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:35:30,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:35:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:35:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:35:30,665 INFO L87 Difference]: Start difference. First operand 21501 states and 24272 transitions. Second operand 4 states. [2018-10-26 19:35:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:35:36,145 INFO L93 Difference]: Finished difference Result 53649 states and 61013 transitions. [2018-10-26 19:35:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:35:36,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-10-26 19:35:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:35:36,195 INFO L225 Difference]: With dead ends: 53649 [2018-10-26 19:35:36,195 INFO L226 Difference]: Without dead ends: 31288 [2018-10-26 19:35:36,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:35:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31288 states. [2018-10-26 19:35:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31288 to 27439. [2018-10-26 19:35:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27439 states. [2018-10-26 19:35:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27439 states to 27439 states and 30410 transitions. [2018-10-26 19:35:36,532 INFO L78 Accepts]: Start accepts. Automaton has 27439 states and 30410 transitions. Word has length 374 [2018-10-26 19:35:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:35:36,532 INFO L481 AbstractCegarLoop]: Abstraction has 27439 states and 30410 transitions. [2018-10-26 19:35:36,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:35:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 27439 states and 30410 transitions. [2018-10-26 19:35:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-26 19:35:36,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:35:36,546 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:35:36,546 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:35:36,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:35:36,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1165552730, now seen corresponding path program 1 times [2018-10-26 19:35:36,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:35:36,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:35:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:36,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 202 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:35:37,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:35:37,375 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 19:35:37,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:37,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:35:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 202 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:35:37,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:35:37,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-10-26 19:35:37,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:35:37,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:35:37,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:35:37,851 INFO L87 Difference]: Start difference. First operand 27439 states and 30410 transitions. Second operand 9 states. [2018-10-26 19:35:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:35:50,029 INFO L93 Difference]: Finished difference Result 56732 states and 62769 transitions. [2018-10-26 19:35:50,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:35:50,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 415 [2018-10-26 19:35:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:35:50,071 INFO L225 Difference]: With dead ends: 56732 [2018-10-26 19:35:50,071 INFO L226 Difference]: Without dead ends: 29721 [2018-10-26 19:35:50,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 413 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:35:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29721 states. [2018-10-26 19:35:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29721 to 29569. [2018-10-26 19:35:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29569 states. [2018-10-26 19:35:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29569 states to 29569 states and 32614 transitions. [2018-10-26 19:35:50,400 INFO L78 Accepts]: Start accepts. Automaton has 29569 states and 32614 transitions. Word has length 415 [2018-10-26 19:35:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:35:50,400 INFO L481 AbstractCegarLoop]: Abstraction has 29569 states and 32614 transitions. [2018-10-26 19:35:50,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:35:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 29569 states and 32614 transitions. [2018-10-26 19:35:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-26 19:35:50,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:35:50,418 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:35:50,418 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:35:50,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:35:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash 94454684, now seen corresponding path program 1 times [2018-10-26 19:35:50,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:35:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:35:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:50,971 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-10-26 19:35:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-10-26 19:35:51,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:35:51,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:35:51,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:35:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:35:51,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:35:51,165 INFO L87 Difference]: Start difference. First operand 29569 states and 32614 transitions. Second operand 4 states. [2018-10-26 19:35:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:35:56,707 INFO L93 Difference]: Finished difference Result 73694 states and 81487 transitions. [2018-10-26 19:35:56,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:35:56,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2018-10-26 19:35:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:35:56,755 INFO L225 Difference]: With dead ends: 73694 [2018-10-26 19:35:56,756 INFO L226 Difference]: Without dead ends: 44979 [2018-10-26 19:35:56,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:35:56,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44979 states. [2018-10-26 19:35:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44979 to 26566. [2018-10-26 19:35:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26566 states. [2018-10-26 19:35:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26566 states to 26566 states and 29041 transitions. [2018-10-26 19:35:57,148 INFO L78 Accepts]: Start accepts. Automaton has 26566 states and 29041 transitions. Word has length 496 [2018-10-26 19:35:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:35:57,149 INFO L481 AbstractCegarLoop]: Abstraction has 26566 states and 29041 transitions. [2018-10-26 19:35:57,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:35:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 26566 states and 29041 transitions. [2018-10-26 19:35:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-10-26 19:35:57,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:35:57,168 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:35:57,168 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:35:57,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:35:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2017435882, now seen corresponding path program 1 times [2018-10-26 19:35:57,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:35:57,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:35:57,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:57,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:35:57,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:35:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:35:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-10-26 19:35:57,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:35:57,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:35:57,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:35:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:35:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:35:57,525 INFO L87 Difference]: Start difference. First operand 26566 states and 29041 transitions. Second operand 3 states. [2018-10-26 19:36:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:36:01,449 INFO L93 Difference]: Finished difference Result 56535 states and 61828 transitions. [2018-10-26 19:36:01,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:36:01,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2018-10-26 19:36:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:36:01,484 INFO L225 Difference]: With dead ends: 56535 [2018-10-26 19:36:01,484 INFO L226 Difference]: Without dead ends: 30823 [2018-10-26 19:36:01,502 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 19:36:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30823 states. [2018-10-26 19:36:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30823 to 30393. [2018-10-26 19:36:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30393 states. [2018-10-26 19:36:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30393 states to 30393 states and 32922 transitions. [2018-10-26 19:36:01,842 INFO L78 Accepts]: Start accepts. Automaton has 30393 states and 32922 transitions. Word has length 502 [2018-10-26 19:36:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:36:01,844 INFO L481 AbstractCegarLoop]: Abstraction has 30393 states and 32922 transitions. [2018-10-26 19:36:01,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:36:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 30393 states and 32922 transitions. [2018-10-26 19:36:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-10-26 19:36:01,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:36:01,858 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-10-26 19:36:01,858 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:36:01,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:36:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2107335423, now seen corresponding path program 1 times [2018-10-26 19:36:01,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:36:01,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:36:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:36:01,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:36:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:36:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:36:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2018-10-26 19:36:02,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:36:02,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:36:02,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:36:02,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:36:02,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:36:02,797 INFO L87 Difference]: Start difference. First operand 30393 states and 32922 transitions. Second operand 5 states. [2018-10-26 19:36:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:36:09,585 INFO L93 Difference]: Finished difference Result 83411 states and 90307 transitions. [2018-10-26 19:36:09,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:36:09,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 517 [2018-10-26 19:36:09,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:36:09,634 INFO L225 Difference]: With dead ends: 83411 [2018-10-26 19:36:09,635 INFO L226 Difference]: Without dead ends: 52168 [2018-10-26 19:36:09,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:36:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52168 states. [2018-10-26 19:36:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52168 to 40631. [2018-10-26 19:36:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40631 states. [2018-10-26 19:36:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40631 states to 40631 states and 43733 transitions. [2018-10-26 19:36:10,078 INFO L78 Accepts]: Start accepts. Automaton has 40631 states and 43733 transitions. Word has length 517 [2018-10-26 19:36:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:36:10,079 INFO L481 AbstractCegarLoop]: Abstraction has 40631 states and 43733 transitions. [2018-10-26 19:36:10,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:36:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 40631 states and 43733 transitions. [2018-10-26 19:36:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-10-26 19:36:10,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:36:10,096 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:10,096 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:36:10,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:36:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1392134470, now seen corresponding path program 1 times [2018-10-26 19:36:10,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:36:10,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:36:10,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:36:10,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:36:10,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:36:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:36:10,627 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-10-26 19:36:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-10-26 19:36:11,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:36:11,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:36:11,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:36:11,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:36:11,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:36:11,174 INFO L87 Difference]: Start difference. First operand 40631 states and 43733 transitions. Second operand 4 states. [2018-10-26 19:36:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:36:17,262 INFO L93 Difference]: Finished difference Result 85107 states and 91743 transitions. [2018-10-26 19:36:17,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:36:17,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 550 [2018-10-26 19:36:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:36:17,312 INFO L225 Difference]: With dead ends: 85107 [2018-10-26 19:36:17,312 INFO L226 Difference]: Without dead ends: 47034 [2018-10-26 19:36:17,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:36:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47034 states. [2018-10-26 19:36:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47034 to 39773. [2018-10-26 19:36:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39773 states. [2018-10-26 19:36:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39773 states to 39773 states and 42514 transitions. [2018-10-26 19:36:17,694 INFO L78 Accepts]: Start accepts. Automaton has 39773 states and 42514 transitions. Word has length 550 [2018-10-26 19:36:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:36:17,695 INFO L481 AbstractCegarLoop]: Abstraction has 39773 states and 42514 transitions. [2018-10-26 19:36:17,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:36:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 39773 states and 42514 transitions. [2018-10-26 19:36:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-26 19:36:17,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:36:17,705 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:36:17,706 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:36:17,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:36:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash 62640894, now seen corresponding path program 1 times [2018-10-26 19:36:17,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:36:17,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:36:17,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:36:17,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:36:17,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:36:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:36:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 404 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-26 19:36:18,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:36:18,413 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 19:36:18,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:36:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:36:18,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:36:19,055 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 18 [2018-10-26 19:36:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-10-26 19:36:19,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:36:19,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 19:36:19,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:36:19,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:36:19,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:36:19,854 INFO L87 Difference]: Start difference. First operand 39773 states and 42514 transitions. Second operand 7 states. [2018-10-26 19:36:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:36:56,858 INFO L93 Difference]: Finished difference Result 96645 states and 103489 transitions. [2018-10-26 19:36:56,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 19:36:56,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 562 [2018-10-26 19:36:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:36:56,911 INFO L225 Difference]: With dead ends: 96645 [2018-10-26 19:36:56,912 INFO L226 Difference]: Without dead ends: 58574 [2018-10-26 19:36:56,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 564 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:36:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58574 states. [2018-10-26 19:36:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58574 to 54277. [2018-10-26 19:36:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54277 states. [2018-10-26 19:36:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54277 states to 54277 states and 57541 transitions. [2018-10-26 19:36:57,654 INFO L78 Accepts]: Start accepts. Automaton has 54277 states and 57541 transitions. Word has length 562 [2018-10-26 19:36:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:36:57,654 INFO L481 AbstractCegarLoop]: Abstraction has 54277 states and 57541 transitions. [2018-10-26 19:36:57,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:36:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 54277 states and 57541 transitions. [2018-10-26 19:36:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2018-10-26 19:36:57,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:36:57,670 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:57,671 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:36:57,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:36:57,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1011850501, now seen corresponding path program 1 times [2018-10-26 19:36:57,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:36:57,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:36:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:36:57,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:36:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:36:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:36:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 32 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:36:58,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:36:58,891 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 19:36:58,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:36:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:36:59,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:36:59,310 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-10-26 19:37:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-10-26 19:37:00,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:37:00,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-26 19:37:00,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 19:37:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 19:37:00,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:37:00,320 INFO L87 Difference]: Start difference. First operand 54277 states and 57541 transitions. Second operand 8 states. [2018-10-26 19:37:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:37:17,722 INFO L93 Difference]: Finished difference Result 156774 states and 166264 transitions. [2018-10-26 19:37:17,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 19:37:17,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 634 [2018-10-26 19:37:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:37:17,834 INFO L225 Difference]: With dead ends: 156774 [2018-10-26 19:37:17,835 INFO L226 Difference]: Without dead ends: 102064 [2018-10-26 19:37:17,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 633 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:37:17,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102064 states. [2018-10-26 19:37:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102064 to 72583. [2018-10-26 19:37:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72583 states. [2018-10-26 19:37:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72583 states to 72583 states and 76392 transitions. [2018-10-26 19:37:18,709 INFO L78 Accepts]: Start accepts. Automaton has 72583 states and 76392 transitions. Word has length 634 [2018-10-26 19:37:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:37:18,709 INFO L481 AbstractCegarLoop]: Abstraction has 72583 states and 76392 transitions. [2018-10-26 19:37:18,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 19:37:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 72583 states and 76392 transitions. [2018-10-26 19:37:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-10-26 19:37:18,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:37:18,722 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:37:18,722 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:37:18,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:37:18,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1606349035, now seen corresponding path program 1 times [2018-10-26 19:37:18,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:37:18,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:37:18,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:37:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 629 proven. 248 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-26 19:37:19,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:37:19,600 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:37:19,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:37:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:37:20,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:37:22,192 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_19 Int)) (let ((.cse1 (div (* 10 v_prenex_19) (- 9)))) (let ((.cse0 (* 50 .cse1))) (and (<= c_~a26~0 (div .cse0 9)) (<= 0 .cse0) (= (mod (+ (* 5 .cse1) 4) 9) 0) (< 124 v_prenex_19) (= (mod v_prenex_19 (- 9)) 0))))) (exists ((v_prenex_18 Int)) (let ((.cse4 (* 10 v_prenex_18))) (let ((.cse5 (div .cse4 (- 9)))) (let ((.cse2 (* 50 .cse5)) (.cse3 (* 5 .cse5))) (and (< .cse2 0) (< 124 v_prenex_18) (not (= 0 (mod .cse3 9))) (<= c_~a26~0 (+ (div .cse2 9) 1)) (<= 0 .cse4) (= (mod (+ .cse3 4) 9) 0)))))) (exists ((v_prenex_37 Int)) (let ((.cse7 (div (* 10 v_prenex_37) (- 9)))) (let ((.cse6 (* 50 .cse7))) (and (<= 50 .cse6) (= 0 (mod (* 5 .cse7) 9)) (<= c_~a26~0 (div .cse6 9)) (= (mod v_prenex_37 (- 9)) 0) (< 124 v_prenex_37))))) (exists ((v_~a26~0_1226 Int)) (let ((.cse9 (* 10 v_~a26~0_1226))) (let ((.cse11 (div .cse9 (- 9)))) (let ((.cse8 (* 5 .cse11)) (.cse10 (* 50 .cse11))) (and (not (= 0 (mod .cse8 9))) (< .cse9 0) (< .cse10 0) (not (= (mod (+ .cse8 4) 9) 0)) (<= c_~a26~0 (+ (div (+ .cse10 (- 50)) 9) 1)) (< 124 v_~a26~0_1226) (not (= (mod v_~a26~0_1226 (- 9)) 0)) (< .cse10 50)))))) (exists ((v_prenex_27 Int)) (let ((.cse14 (div (* 10 v_prenex_27) (- 9)))) (let ((.cse13 (* 5 .cse14)) (.cse12 (* 50 .cse14))) (and (< .cse12 50) (= 0 (mod .cse13 9)) (= (mod v_prenex_27 (- 9)) 0) (< 124 v_prenex_27) (not (= (mod (+ .cse13 4) 9) 0)) (<= c_~a26~0 (div .cse12 9)))))) (exists ((v_prenex_38 Int)) (let ((.cse16 (div (* 10 v_prenex_38) (- 9)))) (let ((.cse15 (* 50 .cse16))) (and (= (mod v_prenex_38 (- 9)) 0) (<= c_~a26~0 (+ (div .cse15 9) 1)) (<= 50 .cse15) (not (= 0 (mod (* 5 .cse16) 9))) (< .cse15 0) (< 124 v_prenex_38))))) (exists ((v_prenex_24 Int)) (let ((.cse18 (* 10 v_prenex_24))) (let ((.cse17 (* 50 (div .cse18 (- 9))))) (and (< 124 v_prenex_24) (<= 50 .cse17) (<= 0 .cse17) (<= c_~a26~0 (div .cse17 9)) (<= 0 .cse18))))) (exists ((v_prenex_33 Int)) (let ((.cse21 (* 10 v_prenex_33))) (let ((.cse20 (div .cse21 (- 9)))) (let ((.cse19 (* 50 .cse20))) (and (< 124 v_prenex_33) (< .cse19 0) (<= 50 .cse19) (not (= 0 (mod (* 5 .cse20) 9))) (<= c_~a26~0 (+ (div .cse19 9) 1)) (<= 0 .cse21)))))) (exists ((v_prenex_30 Int)) (let ((.cse23 (div (* 10 v_prenex_30) (- 9)))) (let ((.cse22 (* 50 .cse23))) (and (<= 0 .cse22) (= (mod v_prenex_30 (- 9)) 0) (<= c_~a26~0 (div .cse22 9)) (< 124 v_prenex_30) (not (= (mod (+ (* 5 .cse23) 4) 9) 0)) (< .cse22 50))))) (exists ((v_prenex_26 Int)) (let ((.cse26 (div (* 10 v_prenex_26) (- 9)))) (let ((.cse24 (* 5 .cse26)) (.cse25 (* 50 .cse26))) (and (not (= 0 (mod .cse24 9))) (< .cse25 0) (= (mod (+ .cse24 4) 9) 0) (<= c_~a26~0 (+ (div .cse25 9) 1)) (= (mod v_prenex_26 (- 9)) 0) (< 124 v_prenex_26))))) (exists ((v_prenex_32 Int)) (let ((.cse29 (* 10 v_prenex_32))) (let ((.cse30 (div .cse29 (- 9)))) (let ((.cse28 (* 5 .cse30)) (.cse27 (* 50 .cse30))) (and (<= c_~a26~0 (+ (div (+ .cse27 (- 50)) 9) 1)) (= 0 (mod .cse28 9)) (not (= (mod (+ .cse28 4) 9) 0)) (< 124 v_prenex_32) (< .cse29 0) (< .cse27 50) (not (= (mod v_prenex_32 (- 9)) 0))))))) (exists ((v_prenex_31 Int)) (let ((.cse33 (* 10 v_prenex_31))) (let ((.cse32 (div .cse33 (- 9)))) (let ((.cse31 (* 50 .cse32))) (and (<= 50 .cse31) (< 124 v_prenex_31) (not (= 0 (mod (* 5 .cse32) 9))) (not (= (mod v_prenex_31 (- 9)) 0)) (<= c_~a26~0 (div (+ .cse31 (- 50)) 9)) (< .cse31 0) (< .cse33 0)))))) (exists ((v_prenex_25 Int)) (let ((.cse34 (* 10 v_prenex_25))) (let ((.cse35 (div .cse34 (- 9)))) (let ((.cse36 (* 5 .cse35))) (and (< .cse34 0) (<= c_~a26~0 (div (+ (* 50 .cse35) (- 50)) 9)) (= 0 (mod .cse36 9)) (< 124 v_prenex_25) (not (= (mod v_prenex_25 (- 9)) 0)) (= (mod (+ .cse36 4) 9) 0)))))) (exists ((v_prenex_16 Int)) (let ((.cse37 (* 10 v_prenex_16))) (let ((.cse38 (div .cse37 (- 9)))) (let ((.cse39 (* 50 .cse38))) (and (< 124 v_prenex_16) (<= 0 .cse37) (not (= (mod (+ (* 5 .cse38) 4) 9) 0)) (<= c_~a26~0 (div .cse39 9)) (< .cse39 50) (<= 0 .cse39)))))) (exists ((v_prenex_29 Int)) (let ((.cse41 (* 10 v_prenex_29))) (let ((.cse43 (div .cse41 (- 9)))) (let ((.cse40 (* 5 .cse43)) (.cse42 (* 50 .cse43))) (and (= 0 (mod .cse40 9)) (<= 0 .cse41) (< .cse42 50) (< 124 v_prenex_29) (not (= (mod (+ .cse40 4) 9) 0)) (<= c_~a26~0 (div .cse42 9))))))) (exists ((v_prenex_23 Int)) (let ((.cse45 (* 10 v_prenex_23))) (let ((.cse44 (* 50 (div .cse45 (- 9))))) (and (<= c_~a26~0 (div (+ .cse44 (- 50)) 9)) (< .cse45 0) (not (= (mod v_prenex_23 (- 9)) 0)) (<= 0 .cse44) (< 124 v_prenex_23) (<= 50 .cse44))))) (exists ((v_prenex_34 Int)) (let ((.cse48 (* 10 v_prenex_34))) (let ((.cse47 (div .cse48 (- 9)))) (let ((.cse46 (* 50 .cse47))) (and (<= c_~a26~0 (div .cse46 9)) (<= 50 .cse46) (= 0 (mod (* 5 .cse47) 9)) (< 124 v_prenex_34) (<= 0 .cse48)))))) (exists ((v_prenex_20 Int)) (let ((.cse50 (* 10 v_prenex_20))) (let ((.cse52 (div .cse50 (- 9)))) (let ((.cse49 (* 5 .cse52)) (.cse51 (* 50 .cse52))) (and (not (= (mod (+ .cse49 4) 9) 0)) (<= 0 .cse50) (not (= 0 (mod .cse49 9))) (< .cse51 50) (< .cse51 0) (<= c_~a26~0 (+ (div .cse51 9) 1)) (< 124 v_prenex_20)))))) (exists ((v_prenex_13 Int)) (let ((.cse54 (div (* 10 v_prenex_13) (- 9)))) (let ((.cse53 (* 5 .cse54))) (and (= (mod (+ .cse53 4) 9) 0) (= 0 (mod .cse53 9)) (< 124 v_prenex_13) (= (mod v_prenex_13 (- 9)) 0) (<= c_~a26~0 (div (* 50 .cse54) 9)))))) (exists ((v_prenex_15 Int)) (let ((.cse57 (* 10 v_prenex_15))) (let ((.cse56 (div .cse57 (- 9)))) (let ((.cse55 (* 50 .cse56))) (and (<= 50 .cse55) (= 0 (mod (* 5 .cse56) 9)) (not (= (mod v_prenex_15 (- 9)) 0)) (<= c_~a26~0 (div (+ .cse55 (- 50)) 9)) (< 124 v_prenex_15) (< .cse57 0)))))) (exists ((v_prenex_17 Int)) (let ((.cse60 (* 10 v_prenex_17))) (let ((.cse61 (div .cse60 (- 9)))) (let ((.cse58 (* 5 .cse61)) (.cse59 (* 50 .cse61))) (and (= (mod (+ .cse58 4) 9) 0) (not (= (mod v_prenex_17 (- 9)) 0)) (< .cse59 0) (< .cse60 0) (not (= 0 (mod .cse58 9))) (<= c_~a26~0 (div (+ .cse59 (- 50)) 9)) (< 124 v_prenex_17)))))) (exists ((v_prenex_28 Int)) (let ((.cse64 (div (* 10 v_prenex_28) (- 9)))) (let ((.cse62 (* 5 .cse64)) (.cse63 (* 50 .cse64))) (and (not (= 0 (mod .cse62 9))) (< 124 v_prenex_28) (<= c_~a26~0 (+ (div .cse63 9) 1)) (= (mod v_prenex_28 (- 9)) 0) (not (= (mod (+ .cse62 4) 9) 0)) (< .cse63 0) (< .cse63 50))))) (exists ((v_prenex_22 Int)) (let ((.cse65 (* 10 v_prenex_22))) (let ((.cse67 (div .cse65 (- 9)))) (let ((.cse66 (* 50 .cse67))) (and (< .cse65 0) (< 124 v_prenex_22) (< .cse66 50) (<= 0 .cse66) (<= c_~a26~0 (+ (div (+ .cse66 (- 50)) 9) 1)) (not (= (mod v_prenex_22 (- 9)) 0)) (not (= (mod (+ (* 5 .cse67) 4) 9) 0))))))) (exists ((v_prenex_21 Int)) (let ((.cse69 (* 10 v_prenex_21))) (let ((.cse70 (div .cse69 (- 9)))) (let ((.cse68 (* 50 .cse70))) (and (<= c_~a26~0 (div .cse68 9)) (<= 0 .cse69) (= (mod (+ (* 5 .cse70) 4) 9) 0) (< 124 v_prenex_21) (<= 0 .cse68)))))) (exists ((v_prenex_14 Int)) (let ((.cse71 (* 10 v_prenex_14))) (let ((.cse73 (div .cse71 (- 9)))) (let ((.cse72 (* 50 .cse73))) (and (< 124 v_prenex_14) (not (= (mod v_prenex_14 (- 9)) 0)) (< .cse71 0) (<= 0 .cse72) (<= c_~a26~0 (div (+ .cse72 (- 50)) 9)) (= (mod (+ (* 5 .cse73) 4) 9) 0)))))) (exists ((v_prenex_36 Int)) (let ((.cse74 (* 50 (div (* 10 v_prenex_36) (- 9))))) (and (< 124 v_prenex_36) (<= c_~a26~0 (div .cse74 9)) (= (mod v_prenex_36 (- 9)) 0) (<= 0 .cse74) (<= 50 .cse74)))) (exists ((v_prenex_35 Int)) (let ((.cse76 (* 10 v_prenex_35))) (let ((.cse77 (div .cse76 (- 9)))) (let ((.cse75 (* 5 .cse77))) (and (< 124 v_prenex_35) (= (mod (+ .cse75 4) 9) 0) (<= 0 .cse76) (<= c_~a26~0 (div (* 50 .cse77) 9)) (= 0 (mod .cse75 9)))))))) is different from false [2018-10-26 19:37:27,475 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_19 Int)) (let ((.cse1 (div (* 10 v_prenex_19) (- 9)))) (let ((.cse0 (* 50 .cse1))) (and (<= (+ c_~a26~0 600126) (div .cse0 9)) (<= 0 .cse0) (= (mod (+ (* 5 .cse1) 4) 9) 0) (< 124 v_prenex_19) (= (mod v_prenex_19 (- 9)) 0))))) (exists ((v_prenex_33 Int)) (let ((.cse4 (* 10 v_prenex_33))) (let ((.cse3 (div .cse4 (- 9)))) (let ((.cse2 (* 50 .cse3))) (and (< 124 v_prenex_33) (< .cse2 0) (<= 50 .cse2) (not (= 0 (mod (* 5 .cse3) 9))) (<= (+ c_~a26~0 600125) (div .cse2 9)) (<= 0 .cse4)))))) (exists ((v_prenex_15 Int)) (let ((.cse7 (* 10 v_prenex_15))) (let ((.cse6 (div .cse7 (- 9)))) (let ((.cse5 (* 50 .cse6))) (and (<= 50 .cse5) (= 0 (mod (* 5 .cse6) 9)) (not (= (mod v_prenex_15 (- 9)) 0)) (< 124 v_prenex_15) (< .cse7 0) (<= (+ c_~a26~0 600126) (div (+ .cse5 (- 50)) 9))))))) (exists ((v_prenex_25 Int)) (let ((.cse8 (* 10 v_prenex_25))) (let ((.cse9 (div .cse8 (- 9)))) (let ((.cse10 (* 5 .cse9))) (and (< .cse8 0) (<= (+ c_~a26~0 600126) (div (+ (* 50 .cse9) (- 50)) 9)) (= 0 (mod .cse10 9)) (< 124 v_prenex_25) (not (= (mod v_prenex_25 (- 9)) 0)) (= (mod (+ .cse10 4) 9) 0)))))) (exists ((v_prenex_24 Int)) (let ((.cse12 (* 10 v_prenex_24))) (let ((.cse11 (* 50 (div .cse12 (- 9))))) (and (< 124 v_prenex_24) (<= (+ c_~a26~0 600126) (div .cse11 9)) (<= 50 .cse11) (<= 0 .cse11) (<= 0 .cse12))))) (exists ((v_prenex_16 Int)) (let ((.cse14 (* 10 v_prenex_16))) (let ((.cse15 (div .cse14 (- 9)))) (let ((.cse13 (* 50 .cse15))) (and (< 124 v_prenex_16) (<= (+ c_~a26~0 600126) (div .cse13 9)) (<= 0 .cse14) (not (= (mod (+ (* 5 .cse15) 4) 9) 0)) (< .cse13 50) (<= 0 .cse13)))))) (exists ((v_prenex_17 Int)) (let ((.cse18 (* 10 v_prenex_17))) (let ((.cse19 (div .cse18 (- 9)))) (let ((.cse17 (* 50 .cse19)) (.cse16 (* 5 .cse19))) (and (= (mod (+ .cse16 4) 9) 0) (not (= (mod v_prenex_17 (- 9)) 0)) (<= (+ c_~a26~0 600126) (div (+ .cse17 (- 50)) 9)) (< .cse17 0) (< .cse18 0) (not (= 0 (mod .cse16 9))) (< 124 v_prenex_17)))))) (exists ((v_prenex_38 Int)) (let ((.cse21 (div (* 10 v_prenex_38) (- 9)))) (let ((.cse20 (* 50 .cse21))) (and (= (mod v_prenex_38 (- 9)) 0) (<= (+ c_~a26~0 600125) (div .cse20 9)) (<= 50 .cse20) (not (= 0 (mod (* 5 .cse21) 9))) (< .cse20 0) (< 124 v_prenex_38))))) (exists ((v_prenex_21 Int)) (let ((.cse22 (* 10 v_prenex_21))) (let ((.cse24 (div .cse22 (- 9)))) (let ((.cse23 (* 50 .cse24))) (and (<= 0 .cse22) (<= (+ c_~a26~0 600126) (div .cse23 9)) (= (mod (+ (* 5 .cse24) 4) 9) 0) (< 124 v_prenex_21) (<= 0 .cse23)))))) (exists ((v_prenex_29 Int)) (let ((.cse26 (* 10 v_prenex_29))) (let ((.cse28 (div .cse26 (- 9)))) (let ((.cse27 (* 50 .cse28)) (.cse25 (* 5 .cse28))) (and (= 0 (mod .cse25 9)) (<= 0 .cse26) (< .cse27 50) (<= (+ c_~a26~0 600126) (div .cse27 9)) (< 124 v_prenex_29) (not (= (mod (+ .cse25 4) 9) 0))))))) (exists ((v_prenex_14 Int)) (let ((.cse30 (* 10 v_prenex_14))) (let ((.cse31 (div .cse30 (- 9)))) (let ((.cse29 (* 50 .cse31))) (and (<= (+ c_~a26~0 600126) (div (+ .cse29 (- 50)) 9)) (< 124 v_prenex_14) (not (= (mod v_prenex_14 (- 9)) 0)) (< .cse30 0) (<= 0 .cse29) (= (mod (+ (* 5 .cse31) 4) 9) 0)))))) (exists ((v_~a26~0_1226 Int)) (let ((.cse33 (* 10 v_~a26~0_1226))) (let ((.cse35 (div .cse33 (- 9)))) (let ((.cse32 (* 5 .cse35)) (.cse34 (* 50 .cse35))) (and (not (= 0 (mod .cse32 9))) (< .cse33 0) (< .cse34 0) (not (= (mod (+ .cse32 4) 9) 0)) (<= (+ c_~a26~0 600125) (div (+ .cse34 (- 50)) 9)) (< 124 v_~a26~0_1226) (not (= (mod v_~a26~0_1226 (- 9)) 0)) (< .cse34 50)))))) (exists ((v_prenex_23 Int)) (let ((.cse36 (* 10 v_prenex_23))) (let ((.cse37 (* 50 (div .cse36 (- 9))))) (and (< .cse36 0) (not (= (mod v_prenex_23 (- 9)) 0)) (<= (+ c_~a26~0 600126) (div (+ .cse37 (- 50)) 9)) (<= 0 .cse37) (< 124 v_prenex_23) (<= 50 .cse37))))) (exists ((v_prenex_30 Int)) (let ((.cse39 (div (* 10 v_prenex_30) (- 9)))) (let ((.cse38 (* 50 .cse39))) (and (<= 0 .cse38) (= (mod v_prenex_30 (- 9)) 0) (< 124 v_prenex_30) (not (= (mod (+ (* 5 .cse39) 4) 9) 0)) (< .cse38 50) (<= (+ c_~a26~0 600126) (div .cse38 9)))))) (exists ((v_prenex_13 Int)) (let ((.cse40 (div (* 10 v_prenex_13) (- 9)))) (let ((.cse41 (* 5 .cse40))) (and (<= (+ c_~a26~0 600126) (div (* 50 .cse40) 9)) (= (mod (+ .cse41 4) 9) 0) (= 0 (mod .cse41 9)) (< 124 v_prenex_13) (= (mod v_prenex_13 (- 9)) 0))))) (exists ((v_prenex_22 Int)) (let ((.cse42 (* 10 v_prenex_22))) (let ((.cse44 (div .cse42 (- 9)))) (let ((.cse43 (* 50 .cse44))) (and (< .cse42 0) (< 124 v_prenex_22) (< .cse43 50) (<= 0 .cse43) (not (= (mod v_prenex_22 (- 9)) 0)) (not (= (mod (+ (* 5 .cse44) 4) 9) 0)) (<= (+ c_~a26~0 600125) (div (+ .cse43 (- 50)) 9))))))) (exists ((v_prenex_35 Int)) (let ((.cse46 (* 10 v_prenex_35))) (let ((.cse47 (div .cse46 (- 9)))) (let ((.cse45 (* 5 .cse47))) (and (< 124 v_prenex_35) (= (mod (+ .cse45 4) 9) 0) (<= 0 .cse46) (= 0 (mod .cse45 9)) (<= (+ c_~a26~0 600126) (div (* 50 .cse47) 9))))))) (exists ((v_prenex_32 Int)) (let ((.cse50 (* 10 v_prenex_32))) (let ((.cse51 (div .cse50 (- 9)))) (let ((.cse49 (* 5 .cse51)) (.cse48 (* 50 .cse51))) (and (<= (+ c_~a26~0 600125) (div (+ .cse48 (- 50)) 9)) (= 0 (mod .cse49 9)) (not (= (mod (+ .cse49 4) 9) 0)) (< 124 v_prenex_32) (< .cse50 0) (< .cse48 50) (not (= (mod v_prenex_32 (- 9)) 0))))))) (exists ((v_prenex_26 Int)) (let ((.cse54 (div (* 10 v_prenex_26) (- 9)))) (let ((.cse53 (* 50 .cse54)) (.cse52 (* 5 .cse54))) (and (not (= 0 (mod .cse52 9))) (< .cse53 0) (<= (+ c_~a26~0 600125) (div .cse53 9)) (= (mod (+ .cse52 4) 9) 0) (= (mod v_prenex_26 (- 9)) 0) (< 124 v_prenex_26))))) (exists ((v_prenex_34 Int)) (let ((.cse57 (* 10 v_prenex_34))) (let ((.cse56 (div .cse57 (- 9)))) (let ((.cse55 (* 50 .cse56))) (and (<= 50 .cse55) (= 0 (mod (* 5 .cse56) 9)) (< 124 v_prenex_34) (<= (+ c_~a26~0 600126) (div .cse55 9)) (<= 0 .cse57)))))) (exists ((v_prenex_37 Int)) (let ((.cse59 (div (* 10 v_prenex_37) (- 9)))) (let ((.cse58 (* 50 .cse59))) (and (<= 50 .cse58) (= 0 (mod (* 5 .cse59) 9)) (= (mod v_prenex_37 (- 9)) 0) (<= (+ c_~a26~0 600126) (div .cse58 9)) (< 124 v_prenex_37))))) (exists ((v_prenex_18 Int)) (let ((.cse62 (* 10 v_prenex_18))) (let ((.cse63 (div .cse62 (- 9)))) (let ((.cse60 (* 50 .cse63)) (.cse61 (* 5 .cse63))) (and (< .cse60 0) (<= (+ c_~a26~0 600125) (div .cse60 9)) (< 124 v_prenex_18) (not (= 0 (mod .cse61 9))) (<= 0 .cse62) (= (mod (+ .cse61 4) 9) 0)))))) (exists ((v_prenex_31 Int)) (let ((.cse66 (* 10 v_prenex_31))) (let ((.cse65 (div .cse66 (- 9)))) (let ((.cse64 (* 50 .cse65))) (and (<= 50 .cse64) (<= (+ c_~a26~0 600126) (div (+ .cse64 (- 50)) 9)) (< 124 v_prenex_31) (not (= 0 (mod (* 5 .cse65) 9))) (not (= (mod v_prenex_31 (- 9)) 0)) (< .cse64 0) (< .cse66 0)))))) (exists ((v_prenex_20 Int)) (let ((.cse69 (* 10 v_prenex_20))) (let ((.cse70 (div .cse69 (- 9)))) (let ((.cse67 (* 5 .cse70)) (.cse68 (* 50 .cse70))) (and (not (= (mod (+ .cse67 4) 9) 0)) (<= (+ c_~a26~0 600125) (div .cse68 9)) (<= 0 .cse69) (not (= 0 (mod .cse67 9))) (< .cse68 50) (< .cse68 0) (< 124 v_prenex_20)))))) (exists ((v_prenex_36 Int)) (let ((.cse71 (* 50 (div (* 10 v_prenex_36) (- 9))))) (and (<= (+ c_~a26~0 600126) (div .cse71 9)) (< 124 v_prenex_36) (= (mod v_prenex_36 (- 9)) 0) (<= 0 .cse71) (<= 50 .cse71)))) (exists ((v_prenex_27 Int)) (let ((.cse74 (div (* 10 v_prenex_27) (- 9)))) (let ((.cse72 (* 50 .cse74)) (.cse73 (* 5 .cse74))) (and (< .cse72 50) (= 0 (mod .cse73 9)) (<= (+ c_~a26~0 600126) (div .cse72 9)) (= (mod v_prenex_27 (- 9)) 0) (< 124 v_prenex_27) (not (= (mod (+ .cse73 4) 9) 0)))))) (exists ((v_prenex_28 Int)) (let ((.cse77 (div (* 10 v_prenex_28) (- 9)))) (let ((.cse76 (* 5 .cse77)) (.cse75 (* 50 .cse77))) (and (<= (+ c_~a26~0 600125) (div .cse75 9)) (not (= 0 (mod .cse76 9))) (< 124 v_prenex_28) (= (mod v_prenex_28 (- 9)) 0) (not (= (mod (+ .cse76 4) 9) 0)) (< .cse75 0) (< .cse75 50)))))) is different from false [2018-10-26 19:37:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 533 trivial. 7 not checked. [2018-10-26 19:37:53,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:37:53,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-10-26 19:37:53,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 19:37:53,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 19:37:53,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=40, Unknown=2, NotChecked=26, Total=90 [2018-10-26 19:37:53,249 INFO L87 Difference]: Start difference. First operand 72583 states and 76392 transitions. Second operand 10 states. [2018-10-26 19:38:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:38:09,617 INFO L93 Difference]: Finished difference Result 167561 states and 176626 transitions. [2018-10-26 19:38:09,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 19:38:09,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 637 [2018-10-26 19:38:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:38:09,703 INFO L225 Difference]: With dead ends: 167561 [2018-10-26 19:38:09,703 INFO L226 Difference]: Without dead ends: 97536 [2018-10-26 19:38:09,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=48, Invalid=90, Unknown=2, NotChecked=42, Total=182 [2018-10-26 19:38:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97536 states. [2018-10-26 19:38:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97536 to 84703. [2018-10-26 19:38:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84703 states. [2018-10-26 19:38:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84703 states to 84703 states and 88496 transitions. [2018-10-26 19:38:10,525 INFO L78 Accepts]: Start accepts. Automaton has 84703 states and 88496 transitions. Word has length 637 [2018-10-26 19:38:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:38:10,525 INFO L481 AbstractCegarLoop]: Abstraction has 84703 states and 88496 transitions. [2018-10-26 19:38:10,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 19:38:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 84703 states and 88496 transitions. [2018-10-26 19:38:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2018-10-26 19:38:10,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:38:10,537 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:38:10,537 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:38:10,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:38:10,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1637208476, now seen corresponding path program 1 times [2018-10-26 19:38:10,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:38:10,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:38:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:10,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:38:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 540 proven. 16 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked. [2018-10-26 19:38:11,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:38:11,780 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:38:11,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:38:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:38:11,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:38:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2018-10-26 19:38:12,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:38:12,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-26 19:38:12,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:38:12,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:38:12,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:38:12,435 INFO L87 Difference]: Start difference. First operand 84703 states and 88496 transitions. Second operand 4 states. Received shutdown request... [2018-10-26 19:38:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:38:12,446 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 19:38:12,455 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 19:38:12,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:38:12 BoogieIcfgContainer [2018-10-26 19:38:12,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:38:12,457 INFO L168 Benchmark]: Toolchain (without parser) took 237428.68 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-26 19:38:12,458 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 19:38:12,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1587.63 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 19:38:12,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 522.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 803.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -929.5 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2018-10-26 19:38:12,461 INFO L168 Benchmark]: Boogie Preprocessor took 263.07 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: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:38:12,461 INFO L168 Benchmark]: RCFGBuilder took 9109.08 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: 481.6 MB). Peak memory consumption was 481.6 MB. Max. memory is 7.1 GB. [2018-10-26 19:38:12,462 INFO L168 Benchmark]: TraceAbstraction took 225937.98 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: -506.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-26 19:38:12,467 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 1587.63 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 522.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 803.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -929.5 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 263.07 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: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9109.08 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: 481.6 MB). Peak memory consumption was 481.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225937.98 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: -506.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 32). Cancelled while BasicCegarLoop was constructing difference of abstraction (84703states) and FLOYD_HOARE automaton (currently 3 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 591 locations, 1 error locations. TIMEOUT Result, 225.8s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 171.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5357 SDtfs, 24565 SDslu, 2976 SDs, 0 SdLazy, 62242 SolverSat, 6893 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 151.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3430 GetRequests, 3353 SyntacticMatches, 12 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84703occurred in iteration=14, 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.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 91307 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 42.9s InterpolantComputationTime, 9370 NumberOfCodeBlocks, 9370 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 9348 ConstructedInterpolants, 486 QuantifiedInterpolants, 189944984 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4303 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 10750/12388 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown