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/Problem14_label46_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:30:59,273 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:30:59,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:30:59,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:30:59,295 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:30:59,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:30:59,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:30:59,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:30:59,304 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:30:59,304 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:30:59,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:30:59,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:30:59,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:30:59,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:30:59,317 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:30:59,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:30:59,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:30:59,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:30:59,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:30:59,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:30:59,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:30:59,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:30:59,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:30:59,339 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:30:59,339 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:30:59,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:30:59,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:30:59,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:30:59,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:30:59,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:30:59,347 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:30:59,349 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:30:59,349 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:30:59,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:30:59,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:30:59,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:30:59,352 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-24 16:30:59,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:30:59,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:30:59,384 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:30:59,384 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:30:59,384 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:30:59,385 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:30:59,387 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:30:59,388 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:30:59,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:30:59,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:30:59,388 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:30:59,388 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:30:59,389 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:30:59,389 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:30:59,389 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:30:59,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:30:59,389 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:30:59,389 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:30:59,390 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:30:59,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:30:59,391 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:30:59,391 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:30:59,391 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:30:59,391 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:30:59,391 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:30:59,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:30:59,393 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:30:59,393 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:30:59,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:30:59,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:30:59,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:30:59,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:30:59,470 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:30:59,471 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c [2018-10-24 16:30:59,530 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3c5262650/f97cf96ac94745ff9e1701cc0cc50ef1/FLAGf3d5e275d [2018-10-24 16:31:00,114 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:31:00,117 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c [2018-10-24 16:31:00,143 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3c5262650/f97cf96ac94745ff9e1701cc0cc50ef1/FLAGf3d5e275d [2018-10-24 16:31:00,164 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3c5262650/f97cf96ac94745ff9e1701cc0cc50ef1 [2018-10-24 16:31:00,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:31:00,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:31:00,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:31:00,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:31:00,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:31:00,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:00,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bfd507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00, skipping insertion in model container [2018-10-24 16:31:00,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:00,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:31:00,255 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:31:00,786 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:31:00,791 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:31:00,950 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:31:00,968 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:31:00,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00 WrapperNode [2018-10-24 16:31:00,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:31:00,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:31:00,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:31:00,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:31:00,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:01,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:01,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:31:01,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:31:01,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:31:01,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:31:01,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:01,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:01,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:01,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:01,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:01,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:01,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (1/1) ... [2018-10-24 16:31:01,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:31:01,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:31:01,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:31:01,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:31:01,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (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-24 16:31:01,369 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:31:01,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:31:01,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:31:04,540 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:31:04,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:31:04 BoogieIcfgContainer [2018-10-24 16:31:04,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:31:04,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:31:04,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:31:04,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:31:04,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:31:00" (1/3) ... [2018-10-24 16:31:04,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212ad5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:31:04, skipping insertion in model container [2018-10-24 16:31:04,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:31:00" (2/3) ... [2018-10-24 16:31:04,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212ad5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:31:04, skipping insertion in model container [2018-10-24 16:31:04,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:31:04" (3/3) ... [2018-10-24 16:31:04,550 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label46_true-unreach-call_false-termination.c [2018-10-24 16:31:04,560 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:31:04,574 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:31:04,592 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:31:04,629 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:31:04,629 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:31:04,630 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:31:04,630 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:31:04,630 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:31:04,630 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:31:04,630 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:31:04,631 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:31:04,631 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:31:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-10-24 16:31:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 16:31:04,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:04,664 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:31:04,668 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:04,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash 935177138, now seen corresponding path program 1 times [2018-10-24 16:31:04,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:04,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:04,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:05,126 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-24 16:31:05,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:31:05,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:31:05,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:31:05,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:31:05,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:31:05,155 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-10-24 16:31:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:08,023 INFO L93 Difference]: Finished difference Result 854 states and 1562 transitions. [2018-10-24 16:31:08,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:31:08,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-10-24 16:31:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:08,052 INFO L225 Difference]: With dead ends: 854 [2018-10-24 16:31:08,052 INFO L226 Difference]: Without dead ends: 601 [2018-10-24 16:31:08,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:31:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-10-24 16:31:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-10-24 16:31:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-10-24 16:31:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 992 transitions. [2018-10-24 16:31:08,188 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 992 transitions. Word has length 40 [2018-10-24 16:31:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:08,189 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 992 transitions. [2018-10-24 16:31:08,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:31:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 992 transitions. [2018-10-24 16:31:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-24 16:31:08,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:08,202 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:31:08,203 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:08,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash 896856070, now seen corresponding path program 1 times [2018-10-24 16:31:08,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:08,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:08,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:08,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:08,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:31:08,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:31:08,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:31:08,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:31:08,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:31:08,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:31:08,524 INFO L87 Difference]: Start difference. First operand 601 states and 992 transitions. Second operand 4 states. [2018-10-24 16:31:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:11,517 INFO L93 Difference]: Finished difference Result 2274 states and 3840 transitions. [2018-10-24 16:31:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:31:11,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-10-24 16:31:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:11,527 INFO L225 Difference]: With dead ends: 2274 [2018-10-24 16:31:11,527 INFO L226 Difference]: Without dead ends: 1675 [2018-10-24 16:31:11,530 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-24 16:31:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2018-10-24 16:31:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1496. [2018-10-24 16:31:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-10-24 16:31:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2250 transitions. [2018-10-24 16:31:11,593 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2250 transitions. Word has length 131 [2018-10-24 16:31:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:11,594 INFO L481 AbstractCegarLoop]: Abstraction has 1496 states and 2250 transitions. [2018-10-24 16:31:11,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:31:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2250 transitions. [2018-10-24 16:31:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-24 16:31:11,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:11,615 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:31:11,615 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:11,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash -90583296, now seen corresponding path program 1 times [2018-10-24 16:31:11,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:11,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:11,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:11,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:11,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:11,929 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-24 16:31:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-24 16:31:11,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:31:11,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:31:11,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:31:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:31:11,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:31:11,997 INFO L87 Difference]: Start difference. First operand 1496 states and 2250 transitions. Second operand 4 states. [2018-10-24 16:31:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:15,064 INFO L93 Difference]: Finished difference Result 4793 states and 7208 transitions. [2018-10-24 16:31:15,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:31:15,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-10-24 16:31:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:15,082 INFO L225 Difference]: With dead ends: 4793 [2018-10-24 16:31:15,083 INFO L226 Difference]: Without dead ends: 3299 [2018-10-24 16:31:15,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:31:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2018-10-24 16:31:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3299. [2018-10-24 16:31:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3299 states. [2018-10-24 16:31:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4489 transitions. [2018-10-24 16:31:15,151 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4489 transitions. Word has length 285 [2018-10-24 16:31:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:15,151 INFO L481 AbstractCegarLoop]: Abstraction has 3299 states and 4489 transitions. [2018-10-24 16:31:15,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:31:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4489 transitions. [2018-10-24 16:31:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-24 16:31:15,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:15,159 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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-24 16:31:15,160 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:15,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:15,160 INFO L82 PathProgramCache]: Analyzing trace with hash -623243284, now seen corresponding path program 1 times [2018-10-24 16:31:15,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:15,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:15,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:15,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:15,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 252 proven. 5 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-24 16:31:15,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:31:15,531 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-24 16:31:15,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:15,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:31:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-10-24 16:31:15,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:31:15,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 16:31:15,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:31:15,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:31:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:31:15,914 INFO L87 Difference]: Start difference. First operand 3299 states and 4489 transitions. Second operand 6 states. [2018-10-24 16:31:16,949 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-24 16:31:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:25,806 INFO L93 Difference]: Finished difference Result 9294 states and 12644 transitions. [2018-10-24 16:31:25,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:31:25,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 321 [2018-10-24 16:31:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:25,833 INFO L225 Difference]: With dead ends: 9294 [2018-10-24 16:31:25,833 INFO L226 Difference]: Without dead ends: 5636 [2018-10-24 16:31:25,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:31:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2018-10-24 16:31:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 4538. [2018-10-24 16:31:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4538 states. [2018-10-24 16:31:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 5392 transitions. [2018-10-24 16:31:25,938 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 5392 transitions. Word has length 321 [2018-10-24 16:31:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:25,939 INFO L481 AbstractCegarLoop]: Abstraction has 4538 states and 5392 transitions. [2018-10-24 16:31:25,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:31:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 5392 transitions. [2018-10-24 16:31:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-10-24 16:31:25,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:25,951 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:31:25,951 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:25,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:25,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1969378935, now seen corresponding path program 1 times [2018-10-24 16:31:25,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:25,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:25,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:25,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:25,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 371 proven. 46 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-24 16:31:26,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:31:26,917 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-24 16:31:26,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:27,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:31:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-24 16:31:27,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:31:27,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 16:31:27,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:31:27,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:31:27,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:31:27,304 INFO L87 Difference]: Start difference. First operand 4538 states and 5392 transitions. Second operand 8 states. [2018-10-24 16:31:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:33,375 INFO L93 Difference]: Finished difference Result 9273 states and 10988 transitions. [2018-10-24 16:31:33,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 16:31:33,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 453 [2018-10-24 16:31:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:33,397 INFO L225 Difference]: With dead ends: 9273 [2018-10-24 16:31:33,397 INFO L226 Difference]: Without dead ends: 4916 [2018-10-24 16:31:33,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:31:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4916 states. [2018-10-24 16:31:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4916 to 4538. [2018-10-24 16:31:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4538 states. [2018-10-24 16:31:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 5124 transitions. [2018-10-24 16:31:33,479 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 5124 transitions. Word has length 453 [2018-10-24 16:31:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:33,480 INFO L481 AbstractCegarLoop]: Abstraction has 4538 states and 5124 transitions. [2018-10-24 16:31:33,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:31:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 5124 transitions. [2018-10-24 16:31:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-24 16:31:33,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:33,498 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:31:33,499 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:33,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:33,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2022638733, now seen corresponding path program 1 times [2018-10-24 16:31:33,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:33,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:33,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:34,087 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 16:31:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 1006 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-10-24 16:31:34,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:31:34,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 16:31:34,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:31:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:31:34,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:31:34,475 INFO L87 Difference]: Start difference. First operand 4538 states and 5124 transitions. Second operand 7 states. [2018-10-24 16:31:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:36,330 INFO L93 Difference]: Finished difference Result 9546 states and 10894 transitions. [2018-10-24 16:31:36,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:31:36,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 648 [2018-10-24 16:31:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:36,351 INFO L225 Difference]: With dead ends: 9546 [2018-10-24 16:31:36,351 INFO L226 Difference]: Without dead ends: 4535 [2018-10-24 16:31:36,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:31:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2018-10-24 16:31:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4535. [2018-10-24 16:31:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4535 states. [2018-10-24 16:31:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 5047 transitions. [2018-10-24 16:31:36,426 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 5047 transitions. Word has length 648 [2018-10-24 16:31:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:36,427 INFO L481 AbstractCegarLoop]: Abstraction has 4535 states and 5047 transitions. [2018-10-24 16:31:36,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:31:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 5047 transitions. [2018-10-24 16:31:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2018-10-24 16:31:36,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:36,449 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:31:36,449 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:36,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:36,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1502830499, now seen corresponding path program 1 times [2018-10-24 16:31:36,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:36,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:36,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:36,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:36,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 1340 proven. 201 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-10-24 16:31:38,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:31:38,101 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-24 16:31:38,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:38,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:31:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2018-10-24 16:31:38,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:31:38,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-24 16:31:38,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 16:31:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 16:31:38,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:31:38,567 INFO L87 Difference]: Start difference. First operand 4535 states and 5047 transitions. Second operand 10 states. [2018-10-24 16:31:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:42,348 INFO L93 Difference]: Finished difference Result 9975 states and 11128 transitions. [2018-10-24 16:31:42,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 16:31:42,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 775 [2018-10-24 16:31:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:42,368 INFO L225 Difference]: With dead ends: 9975 [2018-10-24 16:31:42,368 INFO L226 Difference]: Without dead ends: 5621 [2018-10-24 16:31:42,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-10-24 16:31:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5621 states. [2018-10-24 16:31:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5621 to 5609. [2018-10-24 16:31:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5609 states. [2018-10-24 16:31:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 6104 transitions. [2018-10-24 16:31:42,456 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 6104 transitions. Word has length 775 [2018-10-24 16:31:42,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:42,457 INFO L481 AbstractCegarLoop]: Abstraction has 5609 states and 6104 transitions. [2018-10-24 16:31:42,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 16:31:42,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 6104 transitions. [2018-10-24 16:31:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2018-10-24 16:31:42,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:42,488 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:31:42,489 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:42,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash -949121, now seen corresponding path program 1 times [2018-10-24 16:31:42,489 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:42,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:42,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:42,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:42,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 1729 proven. 156 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-10-24 16:31:43,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:31:43,702 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-24 16:31:43,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:43,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:31:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 1729 proven. 156 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-10-24 16:31:44,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:31:44,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-10-24 16:31:44,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:31:44,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:31:44,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:31:44,577 INFO L87 Difference]: Start difference. First operand 5609 states and 6104 transitions. Second operand 5 states. [2018-10-24 16:31:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:47,551 INFO L93 Difference]: Finished difference Result 13199 states and 14389 transitions. [2018-10-24 16:31:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:31:47,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 877 [2018-10-24 16:31:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:47,584 INFO L225 Difference]: With dead ends: 13199 [2018-10-24 16:31:47,584 INFO L226 Difference]: Without dead ends: 7771 [2018-10-24 16:31:47,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 879 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-24 16:31:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2018-10-24 16:31:47,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 6862. [2018-10-24 16:31:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6862 states. [2018-10-24 16:31:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 7426 transitions. [2018-10-24 16:31:47,700 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 7426 transitions. Word has length 877 [2018-10-24 16:31:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:47,702 INFO L481 AbstractCegarLoop]: Abstraction has 6862 states and 7426 transitions. [2018-10-24 16:31:47,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:31:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 7426 transitions. [2018-10-24 16:31:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2018-10-24 16:31:47,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:47,720 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:31:47,720 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:47,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1389360376, now seen corresponding path program 1 times [2018-10-24 16:31:47,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:47,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:47,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:47,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:47,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:48,623 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 16:31:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2909 backedges. 1803 proven. 0 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2018-10-24 16:31:49,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:31:49,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:31:49,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:31:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:31:49,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:31:49,845 INFO L87 Difference]: Start difference. First operand 6862 states and 7426 transitions. Second operand 6 states. [2018-10-24 16:31:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:52,300 INFO L93 Difference]: Finished difference Result 14999 states and 16259 transitions. [2018-10-24 16:31:52,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 16:31:52,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 929 [2018-10-24 16:31:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:52,318 INFO L225 Difference]: With dead ends: 14999 [2018-10-24 16:31:52,318 INFO L226 Difference]: Without dead ends: 8318 [2018-10-24 16:31:52,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:31:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8318 states. [2018-10-24 16:31:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8318 to 6862. [2018-10-24 16:31:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6862 states. [2018-10-24 16:31:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 7382 transitions. [2018-10-24 16:31:52,411 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 7382 transitions. Word has length 929 [2018-10-24 16:31:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:52,413 INFO L481 AbstractCegarLoop]: Abstraction has 6862 states and 7382 transitions. [2018-10-24 16:31:52,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:31:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 7382 transitions. [2018-10-24 16:31:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2018-10-24 16:31:52,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:52,429 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 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, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:31:52,429 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:52,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1348821485, now seen corresponding path program 1 times [2018-10-24 16:31:52,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:52,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:52,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:52,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3574 backedges. 2218 proven. 0 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2018-10-24 16:31:53,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:31:53,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:31:53,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:31:53,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:31:53,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:31:53,389 INFO L87 Difference]: Start difference. First operand 6862 states and 7382 transitions. Second operand 5 states. [2018-10-24 16:31:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:55,516 INFO L93 Difference]: Finished difference Result 15350 states and 16515 transitions. [2018-10-24 16:31:55,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:31:55,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1046 [2018-10-24 16:31:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:55,535 INFO L225 Difference]: With dead ends: 15350 [2018-10-24 16:31:55,535 INFO L226 Difference]: Without dead ends: 8669 [2018-10-24 16:31:55,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:31:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8669 states. [2018-10-24 16:31:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8669 to 7768. [2018-10-24 16:31:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7768 states. [2018-10-24 16:31:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7768 states to 7768 states and 8371 transitions. [2018-10-24 16:31:55,660 INFO L78 Accepts]: Start accepts. Automaton has 7768 states and 8371 transitions. Word has length 1046 [2018-10-24 16:31:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:55,662 INFO L481 AbstractCegarLoop]: Abstraction has 7768 states and 8371 transitions. [2018-10-24 16:31:55,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:31:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7768 states and 8371 transitions. [2018-10-24 16:31:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-10-24 16:31:55,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:55,684 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:31:55,684 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:55,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:55,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1285085745, now seen corresponding path program 1 times [2018-10-24 16:31:55,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:55,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:55,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:55,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:55,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1622 proven. 323 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2018-10-24 16:31:57,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:31:57,765 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-24 16:31:57,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:57,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:32:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1938 proven. 7 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2018-10-24 16:32:00,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:32:00,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2018-10-24 16:32:00,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:32:00,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:32:00,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:32:00,217 INFO L87 Difference]: Start difference. First operand 7768 states and 8371 transitions. Second operand 7 states. [2018-10-24 16:32:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:32:04,399 INFO L93 Difference]: Finished difference Result 18045 states and 19395 transitions. [2018-10-24 16:32:04,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 16:32:04,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1047 [2018-10-24 16:32:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:32:04,418 INFO L225 Difference]: With dead ends: 18045 [2018-10-24 16:32:04,418 INFO L226 Difference]: Without dead ends: 10154 [2018-10-24 16:32:04,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 1046 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:32:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10154 states. [2018-10-24 16:32:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10154 to 8236. [2018-10-24 16:32:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8236 states. [2018-10-24 16:32:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 8854 transitions. [2018-10-24 16:32:04,552 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 8854 transitions. Word has length 1047 [2018-10-24 16:32:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:32:04,553 INFO L481 AbstractCegarLoop]: Abstraction has 8236 states and 8854 transitions. [2018-10-24 16:32:04,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:32:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 8854 transitions. [2018-10-24 16:32:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2018-10-24 16:32:04,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:32:04,570 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:32:04,570 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:32:04,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:32:04,571 INFO L82 PathProgramCache]: Analyzing trace with hash 297398189, now seen corresponding path program 1 times [2018-10-24 16:32:04,571 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:32:04,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:32:04,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:32:04,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:32:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:32:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:32:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3762 backedges. 1755 proven. 0 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2018-10-24 16:32:05,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:32:05,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:32:05,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:32:05,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:32:05,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:32:05,710 INFO L87 Difference]: Start difference. First operand 8236 states and 8854 transitions. Second operand 5 states. [2018-10-24 16:32:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:32:07,485 INFO L93 Difference]: Finished difference Result 18242 states and 19669 transitions. [2018-10-24 16:32:07,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:32:07,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1079 [2018-10-24 16:32:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:32:07,499 INFO L225 Difference]: With dead ends: 18242 [2018-10-24 16:32:07,500 INFO L226 Difference]: Without dead ends: 10187 [2018-10-24 16:32:07,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:32:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10187 states. [2018-10-24 16:32:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10187 to 10008. [2018-10-24 16:32:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10008 states. [2018-10-24 16:32:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 10600 transitions. [2018-10-24 16:32:07,634 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 10600 transitions. Word has length 1079 [2018-10-24 16:32:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:32:07,635 INFO L481 AbstractCegarLoop]: Abstraction has 10008 states and 10600 transitions. [2018-10-24 16:32:07,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:32:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 10600 transitions. [2018-10-24 16:32:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1712 [2018-10-24 16:32:07,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:32:07,668 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:32:07,669 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:32:07,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:32:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash -194796257, now seen corresponding path program 1 times [2018-10-24 16:32:07,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:32:07,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:32:07,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:32:07,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:32:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:32:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:32:08,916 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 16:32:09,162 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 16:32:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9527 backedges. 2675 proven. 1052 refuted. 0 times theorem prover too weak. 5800 trivial. 0 not checked. [2018-10-24 16:32:11,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:32:11,714 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-24 16:32:11,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:32:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:32:12,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:32:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9527 backedges. 2647 proven. 0 refuted. 0 times theorem prover too weak. 6880 trivial. 0 not checked. [2018-10-24 16:32:13,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:32:13,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 16:32:13,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 16:32:13,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 16:32:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:32:13,336 INFO L87 Difference]: Start difference. First operand 10008 states and 10600 transitions. Second operand 11 states. [2018-10-24 16:32:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:32:16,437 INFO L93 Difference]: Finished difference Result 19356 states and 20529 transitions. [2018-10-24 16:32:16,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 16:32:16,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1711 [2018-10-24 16:32:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:32:16,456 INFO L225 Difference]: With dead ends: 19356 [2018-10-24 16:32:16,456 INFO L226 Difference]: Without dead ends: 9349 [2018-10-24 16:32:16,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1733 GetRequests, 1715 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-24 16:32:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9349 states. [2018-10-24 16:32:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9349 to 8650. [2018-10-24 16:32:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2018-10-24 16:32:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 9070 transitions. [2018-10-24 16:32:16,584 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 9070 transitions. Word has length 1711 [2018-10-24 16:32:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:32:16,586 INFO L481 AbstractCegarLoop]: Abstraction has 8650 states and 9070 transitions. [2018-10-24 16:32:16,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 16:32:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 9070 transitions. [2018-10-24 16:32:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1762 [2018-10-24 16:32:16,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:32:16,626 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:32:16,627 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:32:16,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:32:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash 202750658, now seen corresponding path program 1 times [2018-10-24 16:32:16,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:32:16,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:32:16,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:32:16,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:32:16,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:32:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:32:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9680 backedges. 3896 proven. 0 refuted. 0 times theorem prover too weak. 5784 trivial. 0 not checked. [2018-10-24 16:32:18,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:32:18,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:32:18,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:32:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:32:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:32:18,865 INFO L87 Difference]: Start difference. First operand 8650 states and 9070 transitions. Second operand 4 states. [2018-10-24 16:32:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:32:22,025 INFO L93 Difference]: Finished difference Result 19437 states and 20419 transitions. [2018-10-24 16:32:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:32:22,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1761 [2018-10-24 16:32:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:32:22,032 INFO L225 Difference]: With dead ends: 19437 [2018-10-24 16:32:22,032 INFO L226 Difference]: Without dead ends: 6829 [2018-10-24 16:32:22,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:32:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2018-10-24 16:32:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 6290. [2018-10-24 16:32:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6290 states. [2018-10-24 16:32:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6290 states to 6290 states and 6451 transitions. [2018-10-24 16:32:22,117 INFO L78 Accepts]: Start accepts. Automaton has 6290 states and 6451 transitions. Word has length 1761 [2018-10-24 16:32:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:32:22,118 INFO L481 AbstractCegarLoop]: Abstraction has 6290 states and 6451 transitions. [2018-10-24 16:32:22,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:32:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6290 states and 6451 transitions. [2018-10-24 16:32:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1834 [2018-10-24 16:32:22,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:32:22,151 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:32:22,152 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:32:22,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:32:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2075115145, now seen corresponding path program 1 times [2018-10-24 16:32:22,153 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:32:22,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:32:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:32:22,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:32:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:32:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:32:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 5710 proven. 648 refuted. 0 times theorem prover too weak. 4697 trivial. 0 not checked. [2018-10-24 16:32:24,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:32:24,672 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-24 16:32:24,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:32:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:32:25,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:32:42,011 WARN L179 SmtUtils]: Spent 16.28 s on a formula simplification. DAG size of input: 154 DAG size of output: 85 [2018-10-24 16:32:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 3921 proven. 216 refuted. 0 times theorem prover too weak. 6918 trivial. 0 not checked. [2018-10-24 16:32:45,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:32:45,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-10-24 16:32:45,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 16:32:45,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 16:32:45,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:32:45,254 INFO L87 Difference]: Start difference. First operand 6290 states and 6451 transitions. Second operand 10 states. [2018-10-24 16:34:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:11,605 INFO L93 Difference]: Finished difference Result 16171 states and 16612 transitions. [2018-10-24 16:34:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 16:34:11,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1833 [2018-10-24 16:34:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:11,613 INFO L225 Difference]: With dead ends: 16171 [2018-10-24 16:34:11,613 INFO L226 Difference]: Without dead ends: 7181 [2018-10-24 16:34:11,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1857 GetRequests, 1839 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-10-24 16:34:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2018-10-24 16:34:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 5562. [2018-10-24 16:34:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5562 states. [2018-10-24 16:34:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 5677 transitions. [2018-10-24 16:34:11,683 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 5677 transitions. Word has length 1833 [2018-10-24 16:34:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:11,684 INFO L481 AbstractCegarLoop]: Abstraction has 5562 states and 5677 transitions. [2018-10-24 16:34:11,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 16:34:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 5677 transitions. [2018-10-24 16:34:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2005 [2018-10-24 16:34:11,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:11,722 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:34:11,722 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:11,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash 554574517, now seen corresponding path program 1 times [2018-10-24 16:34:11,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:11,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:11,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:11,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:11,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12881 backedges. 4348 proven. 0 refuted. 0 times theorem prover too weak. 8533 trivial. 0 not checked. [2018-10-24 16:34:15,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:34:15,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 16:34:15,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:34:15,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:34:15,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:34:15,229 INFO L87 Difference]: Start difference. First operand 5562 states and 5677 transitions. Second operand 7 states. [2018-10-24 16:34:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:34:16,799 INFO L93 Difference]: Finished difference Result 10972 states and 11207 transitions. [2018-10-24 16:34:16,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 16:34:16,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2004 [2018-10-24 16:34:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:34:16,804 INFO L225 Difference]: With dead ends: 10972 [2018-10-24 16:34:16,804 INFO L226 Difference]: Without dead ends: 5379 [2018-10-24 16:34:16,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:34:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2018-10-24 16:34:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 5379. [2018-10-24 16:34:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5379 states. [2018-10-24 16:34:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5379 states to 5379 states and 5477 transitions. [2018-10-24 16:34:16,864 INFO L78 Accepts]: Start accepts. Automaton has 5379 states and 5477 transitions. Word has length 2004 [2018-10-24 16:34:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:34:16,866 INFO L481 AbstractCegarLoop]: Abstraction has 5379 states and 5477 transitions. [2018-10-24 16:34:16,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:34:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5379 states and 5477 transitions. [2018-10-24 16:34:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2138 [2018-10-24 16:34:16,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:34:16,907 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-24 16:34:16,907 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:34:16,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:34:16,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1027662426, now seen corresponding path program 1 times [2018-10-24 16:34:16,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:34:16,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:34:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:34:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14682 backedges. 4624 proven. 216 refuted. 0 times theorem prover too weak. 9842 trivial. 0 not checked. [2018-10-24 16:34:19,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:34:19,937 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:34:19,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:34:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:34:20,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:34:22,603 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_36 Int)) (let ((.cse2 (div (+ v_prenex_36 (- 600066)) 5))) (let ((.cse1 (* 34 .cse2)) (.cse0 (* 4 .cse2))) (and (<= v_prenex_36 599999) (<= 600066 v_prenex_36) (= 0 (mod .cse0 10)) (< (+ .cse1 34) 0) (= (div .cse1 10) c_~a12~0) (not (= 0 (mod (+ .cse0 4) 10))))))) (exists ((v_~a12~0_440 Int)) (let ((.cse6 (div (+ v_~a12~0_440 (- 600066)) 5))) (let ((.cse3 (* 34 .cse6))) (let ((.cse5 (* 4 .cse6)) (.cse4 (+ .cse3 34))) (and (<= v_~a12~0_440 599999) (< .cse3 0) (= (+ (div .cse4 10) 1) c_~a12~0) (not (= (mod (+ v_~a12~0_440 4) 5) 0)) (not (= 0 (mod .cse5 10))) (not (= 0 (mod (+ .cse5 4) 10))) (< v_~a12~0_440 600066) (< .cse4 0)))))) (exists ((v_prenex_32 Int)) (let ((.cse8 (div (+ v_prenex_32 (- 600066)) 5))) (let ((.cse7 (* 34 .cse8))) (and (= (+ (div .cse7 10) 1) c_~a12~0) (not (= 0 (mod (* 4 .cse8) 10))) (= (mod (+ v_prenex_32 4) 5) 0) (< .cse7 0) (<= 0 (+ .cse7 34)) (<= v_prenex_32 599999))))) (exists ((v_prenex_22 Int)) (let ((.cse10 (div (+ v_prenex_22 (- 600066)) 5))) (let ((.cse9 (* 34 .cse10))) (let ((.cse11 (+ .cse9 34))) (and (<= v_prenex_22 599999) (not (= (mod (+ v_prenex_22 4) 5) 0)) (<= 0 .cse9) (not (= 0 (mod (+ (* 4 .cse10) 4) 10))) (< .cse11 0) (< v_prenex_22 600066) (= (+ (div .cse11 10) 1) c_~a12~0)))))) (exists ((v_prenex_31 Int)) (let ((.cse13 (div (+ v_prenex_31 (- 600066)) 5))) (let ((.cse12 (* 34 .cse13))) (and (<= 600066 v_prenex_31) (<= v_prenex_31 599999) (<= 0 .cse12) (= 0 (mod (+ (* 4 .cse13) 4) 10)) (= (div .cse12 10) c_~a12~0))))) (exists ((v_prenex_35 Int)) (let ((.cse16 (div (+ v_prenex_35 (- 600066)) 5))) (let ((.cse14 (* 4 .cse16)) (.cse15 (* 34 .cse16))) (and (= 0 (mod (+ .cse14 4) 10)) (<= v_prenex_35 599999) (not (= 0 (mod .cse14 10))) (< .cse15 0) (= (+ (div .cse15 10) 1) c_~a12~0) (<= 600066 v_prenex_35))))) (exists ((v_prenex_18 Int)) (let ((.cse18 (div (+ v_prenex_18 (- 600066)) 5))) (let ((.cse17 (* 34 .cse18))) (and (= (div .cse17 10) c_~a12~0) (= 0 (mod (* 4 .cse18) 10)) (<= 600066 v_prenex_18) (<= 0 (+ .cse17 34)) (<= v_prenex_18 599999))))) (exists ((v_prenex_16 Int)) (let ((.cse21 (div (+ v_prenex_16 (- 600066)) 5))) (let ((.cse19 (* 4 .cse21)) (.cse20 (* 34 .cse21))) (and (<= v_prenex_16 599999) (not (= 0 (mod .cse19 10))) (not (= 0 (mod (+ .cse19 4) 10))) (= (+ (div .cse20 10) 1) c_~a12~0) (< .cse20 0) (< (+ .cse20 34) 0) (= (mod (+ v_prenex_16 4) 5) 0))))) (exists ((v_prenex_30 Int)) (let ((.cse23 (div (+ v_prenex_30 (- 600066)) 5))) (let ((.cse22 (* 34 .cse23))) (and (< (+ .cse22 34) 0) (= (div .cse22 10) c_~a12~0) (<= v_prenex_30 599999) (not (= 0 (mod (+ (* 4 .cse23) 4) 10))) (= (mod (+ v_prenex_30 4) 5) 0) (<= 0 .cse22))))) (exists ((v_prenex_13 Int)) (let ((.cse25 (div (+ v_prenex_13 (- 600066)) 5))) (let ((.cse24 (* 34 .cse25))) (and (not (= (mod (+ v_prenex_13 4) 5) 0)) (= (div (+ .cse24 34) 10) c_~a12~0) (= 0 (mod (+ (* 4 .cse25) 4) 10)) (<= v_prenex_13 599999) (< v_prenex_13 600066) (<= 0 .cse24))))) (exists ((v_prenex_29 Int)) (let ((.cse26 (* 34 (div (+ v_prenex_29 (- 600066)) 5)))) (let ((.cse27 (+ .cse26 34))) (and (not (= (mod (+ v_prenex_29 4) 5) 0)) (<= 0 .cse26) (= (div .cse27 10) c_~a12~0) (< v_prenex_29 600066) (<= 0 .cse27) (<= v_prenex_29 599999))))) (exists ((v_prenex_23 Int)) (let ((.cse30 (div (+ v_prenex_23 (- 600066)) 5))) (let ((.cse28 (* 34 .cse30)) (.cse29 (* 4 .cse30))) (and (< .cse28 0) (= (div (+ .cse28 34) 10) c_~a12~0) (= 0 (mod (+ .cse29 4) 10)) (not (= 0 (mod .cse29 10))) (< v_prenex_23 600066) (not (= (mod (+ v_prenex_23 4) 5) 0)) (<= v_prenex_23 599999))))) (exists ((v_prenex_37 Int)) (let ((.cse33 (div (+ v_prenex_37 (- 600066)) 5))) (let ((.cse31 (* 4 .cse33)) (.cse32 (* 34 .cse33))) (and (= 0 (mod (+ .cse31 4) 10)) (< .cse32 0) (= (mod (+ v_prenex_37 4) 5) 0) (not (= 0 (mod .cse31 10))) (<= v_prenex_37 599999) (= (+ (div .cse32 10) 1) c_~a12~0))))) (exists ((v_prenex_34 Int)) (let ((.cse35 (div (+ v_prenex_34 (- 600066)) 5))) (let ((.cse34 (+ (* 34 .cse35) 34))) (and (<= 0 .cse34) (= 0 (mod (* 4 .cse35) 10)) (<= v_prenex_34 599999) (not (= (mod (+ v_prenex_34 4) 5) 0)) (= (div .cse34 10) c_~a12~0) (< v_prenex_34 600066))))) (exists ((v_prenex_27 Int)) (let ((.cse38 (div (+ v_prenex_27 (- 600066)) 5))) (let ((.cse37 (* 34 .cse38))) (let ((.cse36 (+ .cse37 34))) (and (<= 0 .cse36) (<= v_prenex_27 599999) (< .cse37 0) (not (= 0 (mod (* 4 .cse38) 10))) (= (div .cse36 10) c_~a12~0) (not (= (mod (+ v_prenex_27 4) 5) 0)) (< v_prenex_27 600066)))))) (exists ((v_prenex_28 Int)) (let ((.cse41 (div (+ v_prenex_28 (- 600066)) 5))) (let ((.cse40 (* 34 .cse41)) (.cse39 (* 4 .cse41))) (and (not (= 0 (mod .cse39 10))) (<= v_prenex_28 599999) (< .cse40 0) (< (+ .cse40 34) 0) (= (+ (div .cse40 10) 1) c_~a12~0) (not (= 0 (mod (+ .cse39 4) 10))) (<= 600066 v_prenex_28))))) (exists ((v_prenex_38 Int)) (let ((.cse43 (div (+ v_prenex_38 (- 600066)) 5))) (let ((.cse42 (* 4 .cse43))) (and (= (mod (+ v_prenex_38 4) 5) 0) (= 0 (mod (+ .cse42 4) 10)) (<= v_prenex_38 599999) (= 0 (mod .cse42 10)) (= (div (* 34 .cse43) 10) c_~a12~0))))) (exists ((v_prenex_17 Int)) (let ((.cse45 (div (+ v_prenex_17 (- 600066)) 5))) (let ((.cse44 (* 4 .cse45))) (and (< v_prenex_17 600066) (not (= (mod (+ v_prenex_17 4) 5) 0)) (= 0 (mod (+ .cse44 4) 10)) (= 0 (mod .cse44 10)) (<= v_prenex_17 599999) (= (div (+ (* 34 .cse45) 34) 10) c_~a12~0))))) (exists ((v_prenex_21 Int)) (let ((.cse48 (div (+ v_prenex_21 (- 600066)) 5))) (let ((.cse47 (* 4 .cse48)) (.cse46 (+ (* 34 .cse48) 34))) (and (= (+ (div .cse46 10) 1) c_~a12~0) (< v_prenex_21 600066) (= 0 (mod .cse47 10)) (not (= 0 (mod (+ .cse47 4) 10))) (< .cse46 0) (not (= (mod (+ v_prenex_21 4) 5) 0)) (<= v_prenex_21 599999))))) (exists ((v_prenex_15 Int)) (let ((.cse49 (* 34 (div (+ v_prenex_15 (- 600066)) 5)))) (and (<= 0 (+ .cse49 34)) (<= v_prenex_15 599999) (<= 600066 v_prenex_15) (<= 0 .cse49) (= (div .cse49 10) c_~a12~0)))) (exists ((v_prenex_33 Int)) (let ((.cse50 (div (+ v_prenex_33 (- 600066)) 5))) (let ((.cse51 (* 4 .cse50))) (and (<= 600066 v_prenex_33) (= (div (* 34 .cse50) 10) c_~a12~0) (= 0 (mod (+ .cse51 4) 10)) (<= v_prenex_33 599999) (= 0 (mod .cse51 10)))))) (exists ((v_prenex_25 Int)) (let ((.cse52 (div (+ v_prenex_25 (- 600066)) 5))) (let ((.cse53 (* 34 .cse52))) (and (= 0 (mod (+ (* 4 .cse52) 4) 10)) (<= v_prenex_25 599999) (= (div .cse53 10) c_~a12~0) (<= 0 .cse53) (= (mod (+ v_prenex_25 4) 5) 0))))) (exists ((v_prenex_14 Int)) (let ((.cse54 (* 34 (div (+ v_prenex_14 (- 600066)) 5)))) (and (<= 0 .cse54) (= (div .cse54 10) c_~a12~0) (<= 0 (+ .cse54 34)) (<= v_prenex_14 599999) (= (mod (+ v_prenex_14 4) 5) 0)))) (exists ((v_prenex_19 Int)) (let ((.cse56 (div (+ v_prenex_19 (- 600066)) 5))) (let ((.cse55 (* 34 .cse56))) (and (<= 0 (+ .cse55 34)) (not (= 0 (mod (* 4 .cse56) 10))) (< .cse55 0) (<= v_prenex_19 599999) (= (+ (div .cse55 10) 1) c_~a12~0) (<= 600066 v_prenex_19))))) (exists ((v_prenex_26 Int)) (let ((.cse59 (div (+ v_prenex_26 (- 600066)) 5))) (let ((.cse57 (* 34 .cse59)) (.cse58 (* 4 .cse59))) (and (< (+ .cse57 34) 0) (not (= 0 (mod (+ .cse58 4) 10))) (= (div .cse57 10) c_~a12~0) (= 0 (mod .cse58 10)) (<= v_prenex_26 599999) (= (mod (+ v_prenex_26 4) 5) 0))))) (exists ((v_prenex_24 Int)) (let ((.cse61 (div (+ v_prenex_24 (- 600066)) 5))) (let ((.cse60 (* 34 .cse61))) (and (<= 0 (+ .cse60 34)) (<= v_prenex_24 599999) (= (div .cse60 10) c_~a12~0) (= (mod (+ v_prenex_24 4) 5) 0) (= 0 (mod (* 4 .cse61) 10)))))) (exists ((v_prenex_20 Int)) (let ((.cse63 (div (+ v_prenex_20 (- 600066)) 5))) (let ((.cse62 (* 34 .cse63))) (and (< (+ .cse62 34) 0) (<= v_prenex_20 599999) (<= 0 .cse62) (= (div .cse62 10) c_~a12~0) (<= 600066 v_prenex_20) (not (= 0 (mod (+ (* 4 .cse63) 4) 10)))))))) is different from false [2018-10-24 16:34:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 14682 backedges. 4548 proven. 178 refuted. 0 times theorem prover too weak. 9842 trivial. 114 not checked. [2018-10-24 16:34:41,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:34:41,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-10-24 16:34:41,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:34:41,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:34:41,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-10-24 16:34:41,312 INFO L87 Difference]: Start difference. First operand 5379 states and 5477 transitions. Second operand 6 states. Received shutdown request... [2018-10-24 16:35:05,431 WARN L187 SmtUtils]: Removed 4 from assertion stack [2018-10-24 16:35:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:35:05,432 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 16:35:05,437 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 16:35:05,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:35:05 BoogieIcfgContainer [2018-10-24 16:35:05,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:35:05,439 INFO L168 Benchmark]: Toolchain (without parser) took 245264.68 ms. Allocated memory was 1.6 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-24 16:35:05,441 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:35:05,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.90 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-24 16:35:05,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 223.19 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -861.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2018-10-24 16:35:05,444 INFO L168 Benchmark]: Boogie Preprocessor took 94.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-10-24 16:35:05,444 INFO L168 Benchmark]: RCFGBuilder took 3252.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 128.6 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. [2018-10-24 16:35:05,445 INFO L168 Benchmark]: TraceAbstraction took 240895.35 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -630.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-24 16:35:05,450 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.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.90 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 223.19 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -861.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.92 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3252.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 128.6 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240895.35 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -630.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 121). Cancelled while BasicCegarLoop was constructing difference of abstraction (5379states) and FLOYD_HOARE automaton (currently 5 states, 6 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. TIMEOUT Result, 240.8s OverallTime, 17 OverallIterations, 18 TraceHistogramMax, 162.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1969 SDtfs, 12848 SDslu, 2334 SDs, 0 SdLazy, 35657 SolverSat, 3629 SolverUnsat, 34 SolverUnknown, 0 SolverNotchecked, 129.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9303 GetRequests, 9182 SyntacticMatches, 17 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 24.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10008occurred in iteration=12, 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: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 9887 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 57.6s InterpolantComputationTime, 26231 NumberOfCodeBlocks, 26231 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 26206 ConstructedInterpolants, 76 QuantifiedInterpolants, 216722411 SizeOfPredicates, 8 NumberOfNonLiveVariables, 11129 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 118277/121595 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown