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/Problem12_label00_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:00:25,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:00:25,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:00:25,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:00:25,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:00:25,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:00:25,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:00:25,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:00:25,341 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:00:25,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:00:25,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:00:25,343 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:00:25,344 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:00:25,345 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:00:25,346 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:00:25,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:00:25,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:00:25,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:00:25,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:00:25,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:00:25,354 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:00:25,355 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:00:25,358 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:00:25,358 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:00:25,358 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:00:25,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:00:25,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:00:25,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:00:25,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:00:25,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:00:25,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:00:25,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:00:25,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:00:25,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:00:25,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:00:25,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:00:25,367 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 14:00:25,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:00:25,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:00:25,395 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:00:25,395 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:00:25,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:00:25,398 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:00:25,398 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:00:25,398 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:00:25,399 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:00:25,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:00:25,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:00:25,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:00:25,399 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:00:25,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:00:25,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:00:25,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:00:25,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:00:25,400 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:00:25,400 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:00:25,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:00:25,403 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:00:25,403 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:00:25,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:00:25,404 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:00:25,404 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:00:25,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:00:25,404 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:00:25,404 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:00:25,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:00:25,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:00:25,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:00:25,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:00:25,476 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:00:25,478 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label00_false-unreach-call.c [2018-10-24 14:00:25,541 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a8df288e4/a3bf1ec227cf42d4bd2c3c2fa632c518/FLAG8272c2fd6 [2018-10-24 14:00:26,320 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:00:26,321 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label00_false-unreach-call.c [2018-10-24 14:00:26,349 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a8df288e4/a3bf1ec227cf42d4bd2c3c2fa632c518/FLAG8272c2fd6 [2018-10-24 14:00:26,364 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a8df288e4/a3bf1ec227cf42d4bd2c3c2fa632c518 [2018-10-24 14:00:26,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:00:26,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:00:26,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:00:26,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:00:26,383 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:00:26,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:00:26" (1/1) ... [2018-10-24 14:00:26,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b394b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:26, skipping insertion in model container [2018-10-24 14:00:26,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:00:26" (1/1) ... [2018-10-24 14:00:26,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:00:26,556 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:00:27,818 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:00:27,824 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:00:28,366 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:00:28,400 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:00:28,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28 WrapperNode [2018-10-24 14:00:28,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:00:28,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:00:28,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:00:28,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:00:28,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (1/1) ... [2018-10-24 14:00:28,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (1/1) ... [2018-10-24 14:00:29,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:00:29,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:00:29,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:00:29,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:00:29,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (1/1) ... [2018-10-24 14:00:29,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (1/1) ... [2018-10-24 14:00:29,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (1/1) ... [2018-10-24 14:00:29,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (1/1) ... [2018-10-24 14:00:29,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (1/1) ... [2018-10-24 14:00:29,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (1/1) ... [2018-10-24 14:00:29,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (1/1) ... [2018-10-24 14:00:29,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:00:29,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:00:29,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:00:29,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:00:29,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (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 14:00:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:00:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:00:29,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:00:38,453 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:00:38,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:00:38 BoogieIcfgContainer [2018-10-24 14:00:38,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:00:38,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:00:38,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:00:38,459 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:00:38,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:00:26" (1/3) ... [2018-10-24 14:00:38,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c942d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:00:38, skipping insertion in model container [2018-10-24 14:00:38,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:00:28" (2/3) ... [2018-10-24 14:00:38,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c942d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:00:38, skipping insertion in model container [2018-10-24 14:00:38,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:00:38" (3/3) ... [2018-10-24 14:00:38,463 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label00_false-unreach-call.c [2018-10-24 14:00:38,474 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:00:38,484 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:00:38,503 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:00:38,546 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:00:38,546 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:00:38,547 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:00:38,547 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:00:38,547 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:00:38,547 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:00:38,547 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:00:38,547 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:00:38,548 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:00:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-24 14:00:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 14:00:38,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:00:38,601 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:00:38,604 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:00:38,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:00:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash 666618706, now seen corresponding path program 1 times [2018-10-24 14:00:38,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:00:38,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:00:38,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:00:38,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:00:38,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:00:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:00:39,018 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 14:00:39,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:00:39,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:00:39,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:00:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:00:39,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:00:39,045 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-10-24 14:00:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:00:50,371 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-10-24 14:00:50,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:00:50,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-24 14:00:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:00:50,415 INFO L225 Difference]: With dead ends: 3146 [2018-10-24 14:00:50,415 INFO L226 Difference]: Without dead ends: 2320 [2018-10-24 14:00:50,424 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 14:00:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-10-24 14:00:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-10-24 14:00:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-10-24 14:00:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3858 transitions. [2018-10-24 14:00:50,594 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3858 transitions. Word has length 16 [2018-10-24 14:00:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:00:50,595 INFO L481 AbstractCegarLoop]: Abstraction has 2320 states and 3858 transitions. [2018-10-24 14:00:50,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:00:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3858 transitions. [2018-10-24 14:00:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 14:00:50,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:00:50,599 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:00:50,599 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:00:50,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:00:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash 451124673, now seen corresponding path program 1 times [2018-10-24 14:00:50,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:00:50,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:00:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:00:50,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:00:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:00:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:00:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:00:51,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:00:51,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:00:51,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:00:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:00:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:00:51,031 INFO L87 Difference]: Start difference. First operand 2320 states and 3858 transitions. Second operand 4 states. [2018-10-24 14:01:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:01:03,109 INFO L93 Difference]: Finished difference Result 9150 states and 15304 transitions. [2018-10-24 14:01:03,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:01:03,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-10-24 14:01:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:01:03,146 INFO L225 Difference]: With dead ends: 9150 [2018-10-24 14:01:03,146 INFO L226 Difference]: Without dead ends: 6832 [2018-10-24 14:01:03,153 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 14:01:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-10-24 14:01:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-10-24 14:01:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-10-24 14:01:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 10758 transitions. [2018-10-24 14:01:03,279 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 10758 transitions. Word has length 88 [2018-10-24 14:01:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:01:03,280 INFO L481 AbstractCegarLoop]: Abstraction has 6832 states and 10758 transitions. [2018-10-24 14:01:03,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:01:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 10758 transitions. [2018-10-24 14:01:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-24 14:01:03,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:01:03,290 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:01:03,293 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:01:03,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:01:03,293 INFO L82 PathProgramCache]: Analyzing trace with hash 891171138, now seen corresponding path program 1 times [2018-10-24 14:01:03,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:01:03,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:01:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:03,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:03,691 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:01:03,862 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-10-24 14:01:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:04,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:01:04,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:01:04,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:01:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:01:04,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:01:04,041 INFO L87 Difference]: Start difference. First operand 6832 states and 10758 transitions. Second operand 6 states. [2018-10-24 14:01:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:01:19,156 INFO L93 Difference]: Finished difference Result 15918 states and 24429 transitions. [2018-10-24 14:01:19,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:01:19,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-10-24 14:01:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:01:19,199 INFO L225 Difference]: With dead ends: 15918 [2018-10-24 14:01:19,200 INFO L226 Difference]: Without dead ends: 9088 [2018-10-24 14:01:19,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:01:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2018-10-24 14:01:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9088. [2018-10-24 14:01:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2018-10-24 14:01:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 12919 transitions. [2018-10-24 14:01:19,383 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 12919 transitions. Word has length 126 [2018-10-24 14:01:19,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:01:19,383 INFO L481 AbstractCegarLoop]: Abstraction has 9088 states and 12919 transitions. [2018-10-24 14:01:19,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:01:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 12919 transitions. [2018-10-24 14:01:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-24 14:01:19,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:01:19,388 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:19,388 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:01:19,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:01:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1169940111, now seen corresponding path program 1 times [2018-10-24 14:01:19,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:01:19,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:01:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:20,027 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-24 14:01:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 93 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:20,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:01:20,139 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 14:01:20,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:20,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:01:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:20,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:01:20,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-24 14:01:20,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:01:20,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:01:20,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:01:20,500 INFO L87 Difference]: Start difference. First operand 9088 states and 12919 transitions. Second operand 6 states. [2018-10-24 14:01:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:01:42,563 INFO L93 Difference]: Finished difference Result 43024 states and 63364 transitions. [2018-10-24 14:01:42,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 14:01:42,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2018-10-24 14:01:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:01:42,656 INFO L225 Difference]: With dead ends: 43024 [2018-10-24 14:01:42,656 INFO L226 Difference]: Without dead ends: 32431 [2018-10-24 14:01:42,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:01:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32431 states. [2018-10-24 14:01:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32431 to 15855. [2018-10-24 14:01:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15855 states. [2018-10-24 14:01:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15855 states to 15855 states and 19326 transitions. [2018-10-24 14:01:43,064 INFO L78 Accepts]: Start accepts. Automaton has 15855 states and 19326 transitions. Word has length 198 [2018-10-24 14:01:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:01:43,065 INFO L481 AbstractCegarLoop]: Abstraction has 15855 states and 19326 transitions. [2018-10-24 14:01:43,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:01:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15855 states and 19326 transitions. [2018-10-24 14:01:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-24 14:01:43,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:01:43,075 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:43,075 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:01:43,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:01:43,076 INFO L82 PathProgramCache]: Analyzing trace with hash -946468968, now seen corresponding path program 1 times [2018-10-24 14:01:43,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:01:43,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:01:43,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:43,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:43,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:01:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:43,521 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:01:43,880 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-10-24 14:01:44,307 WARN L179 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-10-24 14:01:44,620 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-10-24 14:01:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 28 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:44,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:01:44,972 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 14:01:44,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:01:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:01:45,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:01:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 69 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:01:45,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:01:45,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-10-24 14:01:45,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:01:45,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:01:45,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:01:45,405 INFO L87 Difference]: Start difference. First operand 15855 states and 19326 transitions. Second operand 8 states. [2018-10-24 14:02:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:09,065 INFO L93 Difference]: Finished difference Result 45996 states and 57716 transitions. [2018-10-24 14:02:09,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:02:09,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 272 [2018-10-24 14:02:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:09,119 INFO L225 Difference]: With dead ends: 45996 [2018-10-24 14:02:09,119 INFO L226 Difference]: Without dead ends: 29390 [2018-10-24 14:02:09,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-10-24 14:02:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29390 states. [2018-10-24 14:02:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29390 to 26382. [2018-10-24 14:02:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26382 states. [2018-10-24 14:02:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26382 states to 26382 states and 32561 transitions. [2018-10-24 14:02:09,501 INFO L78 Accepts]: Start accepts. Automaton has 26382 states and 32561 transitions. Word has length 272 [2018-10-24 14:02:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:09,502 INFO L481 AbstractCegarLoop]: Abstraction has 26382 states and 32561 transitions. [2018-10-24 14:02:09,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:02:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 26382 states and 32561 transitions. [2018-10-24 14:02:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-10-24 14:02:09,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:09,527 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:02:09,527 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:09,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash 226455178, now seen corresponding path program 1 times [2018-10-24 14:02:09,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:09,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:09,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:09,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 41 proven. 8 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-10-24 14:02:10,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:02:10,498 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 14:02:10,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:10,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:02:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-24 14:02:10,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:02:10,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-24 14:02:10,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:10,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:10,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:10,866 INFO L87 Difference]: Start difference. First operand 26382 states and 32561 transitions. Second operand 4 states. [2018-10-24 14:02:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:20,373 INFO L93 Difference]: Finished difference Result 82902 states and 105047 transitions. [2018-10-24 14:02:20,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:20,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 476 [2018-10-24 14:02:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:20,468 INFO L225 Difference]: With dead ends: 82902 [2018-10-24 14:02:20,468 INFO L226 Difference]: Without dead ends: 57274 [2018-10-24 14:02:20,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 476 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 14:02:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57274 states. [2018-10-24 14:02:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57274 to 38414. [2018-10-24 14:02:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38414 states. [2018-10-24 14:02:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38414 states to 38414 states and 47317 transitions. [2018-10-24 14:02:21,288 INFO L78 Accepts]: Start accepts. Automaton has 38414 states and 47317 transitions. Word has length 476 [2018-10-24 14:02:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:21,289 INFO L481 AbstractCegarLoop]: Abstraction has 38414 states and 47317 transitions. [2018-10-24 14:02:21,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 38414 states and 47317 transitions. [2018-10-24 14:02:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-10-24 14:02:21,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:21,310 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:02:21,311 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:21,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash -67830384, now seen corresponding path program 1 times [2018-10-24 14:02:21,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:21,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:21,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:21,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:21,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-24 14:02:21,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:21,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:21,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:02:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:02:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:02:21,779 INFO L87 Difference]: Start difference. First operand 38414 states and 47317 transitions. Second operand 3 states. [2018-10-24 14:02:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:27,567 INFO L93 Difference]: Finished difference Result 100138 states and 124441 transitions. [2018-10-24 14:02:27,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:02:27,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2018-10-24 14:02:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:27,634 INFO L225 Difference]: With dead ends: 100138 [2018-10-24 14:02:27,634 INFO L226 Difference]: Without dead ends: 62478 [2018-10-24 14:02:27,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:02:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62478 states. [2018-10-24 14:02:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62478 to 62478. [2018-10-24 14:02:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62478 states. [2018-10-24 14:02:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62478 states to 62478 states and 74387 transitions. [2018-10-24 14:02:28,348 INFO L78 Accepts]: Start accepts. Automaton has 62478 states and 74387 transitions. Word has length 491 [2018-10-24 14:02:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:28,349 INFO L481 AbstractCegarLoop]: Abstraction has 62478 states and 74387 transitions. [2018-10-24 14:02:28,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:02:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 62478 states and 74387 transitions. [2018-10-24 14:02:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2018-10-24 14:02:28,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:28,383 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:28,383 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:28,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1228015818, now seen corresponding path program 1 times [2018-10-24 14:02:28,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:28,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:28,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-24 14:02:29,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:02:29,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:29,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:29,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:29,735 INFO L87 Difference]: Start difference. First operand 62478 states and 74387 transitions. Second operand 4 states. [2018-10-24 14:02:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:38,193 INFO L93 Difference]: Finished difference Result 173834 states and 208289 transitions. [2018-10-24 14:02:38,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:38,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 583 [2018-10-24 14:02:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:38,316 INFO L225 Difference]: With dead ends: 173834 [2018-10-24 14:02:38,316 INFO L226 Difference]: Without dead ends: 112110 [2018-10-24 14:02:38,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 14:02:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112110 states. [2018-10-24 14:02:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112110 to 108350. [2018-10-24 14:02:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108350 states. [2018-10-24 14:02:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108350 states to 108350 states and 123852 transitions. [2018-10-24 14:02:39,988 INFO L78 Accepts]: Start accepts. Automaton has 108350 states and 123852 transitions. Word has length 583 [2018-10-24 14:02:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:39,989 INFO L481 AbstractCegarLoop]: Abstraction has 108350 states and 123852 transitions. [2018-10-24 14:02:39,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 108350 states and 123852 transitions. [2018-10-24 14:02:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-10-24 14:02:40,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:40,020 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:40,020 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:40,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:40,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1898815770, now seen corresponding path program 1 times [2018-10-24 14:02:40,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:40,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:40,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:40,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:40,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-24 14:02:40,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:40,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:02:40,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:40,766 INFO L87 Difference]: Start difference. First operand 108350 states and 123852 transitions. Second operand 4 states. [2018-10-24 14:02:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:50,402 INFO L93 Difference]: Finished difference Result 261066 states and 299444 transitions. [2018-10-24 14:02:50,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:50,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 615 [2018-10-24 14:02:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:50,587 INFO L225 Difference]: With dead ends: 261066 [2018-10-24 14:02:50,587 INFO L226 Difference]: Without dead ends: 153470 [2018-10-24 14:02:50,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 6 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 14:02:50,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153470 states. [2018-10-24 14:02:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153470 to 151214. [2018-10-24 14:02:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151214 states. [2018-10-24 14:02:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151214 states to 151214 states and 168414 transitions. [2018-10-24 14:02:52,829 INFO L78 Accepts]: Start accepts. Automaton has 151214 states and 168414 transitions. Word has length 615 [2018-10-24 14:02:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:52,830 INFO L481 AbstractCegarLoop]: Abstraction has 151214 states and 168414 transitions. [2018-10-24 14:02:52,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 151214 states and 168414 transitions. [2018-10-24 14:02:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2018-10-24 14:02:52,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:52,874 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:52,875 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:52,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 631120995, now seen corresponding path program 1 times [2018-10-24 14:02:52,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:52,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:52,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-24 14:02:53,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:53,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:02:53,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:53,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:53,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:53,647 INFO L87 Difference]: Start difference. First operand 151214 states and 168414 transitions. Second operand 4 states. [2018-10-24 14:03:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:01,746 INFO L93 Difference]: Finished difference Result 301674 states and 336069 transitions. [2018-10-24 14:03:01,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:03:01,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 671 [2018-10-24 14:03:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:01,895 INFO L225 Difference]: With dead ends: 301674 [2018-10-24 14:03:01,896 INFO L226 Difference]: Without dead ends: 129372 [2018-10-24 14:03:01,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 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 14:03:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129372 states. [2018-10-24 14:03:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129372 to 121100. [2018-10-24 14:03:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121100 states. [2018-10-24 14:03:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121100 states to 121100 states and 129483 transitions. [2018-10-24 14:03:03,036 INFO L78 Accepts]: Start accepts. Automaton has 121100 states and 129483 transitions. Word has length 671 [2018-10-24 14:03:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:03,036 INFO L481 AbstractCegarLoop]: Abstraction has 121100 states and 129483 transitions. [2018-10-24 14:03:03,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:03:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 121100 states and 129483 transitions. [2018-10-24 14:03:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2018-10-24 14:03:03,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:03,068 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:03:03,068 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:03,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:03,069 INFO L82 PathProgramCache]: Analyzing trace with hash -76188441, now seen corresponding path program 1 times [2018-10-24 14:03:03,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:03,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:03,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:03,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:03,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 672 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-24 14:03:04,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:03:04,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:03:04,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:03:04,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:03:04,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:03:04,721 INFO L87 Difference]: Start difference. First operand 121100 states and 129483 transitions. Second operand 4 states. [2018-10-24 14:03:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:11,788 INFO L93 Difference]: Finished difference Result 241446 states and 258207 transitions. [2018-10-24 14:03:11,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:03:11,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 728 [2018-10-24 14:03:11,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:11,914 INFO L225 Difference]: With dead ends: 241446 [2018-10-24 14:03:11,914 INFO L226 Difference]: Without dead ends: 114320 [2018-10-24 14:03:11,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:03:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114320 states. [2018-10-24 14:03:14,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114320 to 107552. [2018-10-24 14:03:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107552 states. [2018-10-24 14:03:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107552 states to 107552 states and 112906 transitions. [2018-10-24 14:03:14,277 INFO L78 Accepts]: Start accepts. Automaton has 107552 states and 112906 transitions. Word has length 728 [2018-10-24 14:03:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:14,277 INFO L481 AbstractCegarLoop]: Abstraction has 107552 states and 112906 transitions. [2018-10-24 14:03:14,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:03:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 107552 states and 112906 transitions. [2018-10-24 14:03:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2018-10-24 14:03:14,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:14,316 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:03:14,316 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:14,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:14,317 INFO L82 PathProgramCache]: Analyzing trace with hash 17237999, now seen corresponding path program 1 times [2018-10-24 14:03:14,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:14,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:14,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:14,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:14,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2018-10-24 14:03:16,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:03:16,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:03:16,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:03:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:03:16,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:03:16,402 INFO L87 Difference]: Start difference. First operand 107552 states and 112906 transitions. Second operand 3 states. [2018-10-24 14:03:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:20,917 INFO L93 Difference]: Finished difference Result 213597 states and 224295 transitions. [2018-10-24 14:03:20,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:03:20,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 838 [2018-10-24 14:03:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:21,024 INFO L225 Difference]: With dead ends: 213597 [2018-10-24 14:03:21,024 INFO L226 Difference]: Without dead ends: 106799 [2018-10-24 14:03:21,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:03:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106799 states. [2018-10-24 14:03:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106799 to 105295. [2018-10-24 14:03:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105295 states. [2018-10-24 14:03:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105295 states to 105295 states and 109569 transitions. [2018-10-24 14:03:23,541 INFO L78 Accepts]: Start accepts. Automaton has 105295 states and 109569 transitions. Word has length 838 [2018-10-24 14:03:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:23,542 INFO L481 AbstractCegarLoop]: Abstraction has 105295 states and 109569 transitions. [2018-10-24 14:03:23,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:03:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 105295 states and 109569 transitions. [2018-10-24 14:03:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2018-10-24 14:03:23,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:23,587 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:03:23,588 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:23,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2103748173, now seen corresponding path program 1 times [2018-10-24 14:03:23,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:23,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:23,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:24,496 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2018-10-24 14:03:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 478 proven. 380 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:03:29,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:03:29,803 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 14:03:29,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:30,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:03:30,801 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 21 [2018-10-24 14:03:33,093 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~a24~0 13)) (.cse5 (= 14 c_~a7~0)) (.cse6 (= 6 c_~a5~0)) (.cse7 (<= c_~a2~0 189))) (or (and .cse0 (exists ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse2 (* 10 (div (+ v_prenex_58 (- 600240)) 5))) (.cse4 (mod v_prenex_57 299872))) (let ((.cse1 (+ .cse4 433281)) (.cse3 (+ .cse2 10))) (and (<= v_prenex_58 (div .cse1 5)) (< v_prenex_58 600240) (<= 0 .cse2) (<= c_~a17~0 (div .cse3 4)) (= .cse4 0) (<= 0 .cse1) (not (= (mod v_prenex_58 5) 0)) (<= 0 .cse3) (<= (+ v_prenex_57 124) 0))))) .cse5 .cse6 .cse7) (and .cse0 .cse5 (exists ((v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse11 (mod v_prenex_53 299872)) (.cse12 (div (+ v_prenex_54 (- 600240)) 5))) (let ((.cse8 (* 2 .cse12)) (.cse9 (+ .cse11 433281)) (.cse10 (* 10 .cse12))) (and (= (mod (+ .cse8 2) 4) 0) (not (= 0 (mod .cse8 4))) (< v_prenex_54 600240) (<= 0 .cse9) (<= c_~a17~0 (div (+ .cse10 10) 4)) (not (= (mod v_prenex_54 5) 0)) (<= v_prenex_54 (div .cse9 5)) (<= (+ v_prenex_53 124) 0) (< .cse10 0) (= .cse11 0))))) .cse6 .cse7) (and .cse0 .cse5 (exists ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse16 (mod v_prenex_47 299872)) (.cse17 (div (+ v_prenex_48 (- 600240)) 5))) (let ((.cse13 (* 10 .cse17)) (.cse14 (* 2 .cse17)) (.cse15 (+ .cse16 433281))) (and (<= c_~a17~0 (div .cse13 4)) (<= 600240 v_prenex_48) (not (= (mod (+ .cse14 2) 4) 0)) (< (+ .cse13 10) 0) (= 0 (mod .cse14 4)) (<= 0 .cse15) (= .cse16 0) (<= (+ v_prenex_47 124) 0) (<= v_prenex_48 (div .cse15 5)))))) .cse6 .cse7) (and .cse0 .cse5 .cse6 (exists ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse19 (mod v_prenex_30 299872))) (let ((.cse18 (* 10 (div (+ v_prenex_29 (- 600240)) 5))) (.cse20 (+ .cse19 433281))) (and (<= 0 (+ .cse18 10)) (= .cse19 0) (<= 0 .cse18) (<= 0 .cse20) (<= c_~a17~0 (div .cse18 4)) (<= (+ v_prenex_30 124) 0) (= (mod v_prenex_29 5) 0) (<= v_prenex_29 (div .cse20 5)))))) .cse7) (and .cse0 .cse5 .cse6 .cse7 (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse23 (div (+ v_prenex_23 (- 600240)) 5)) (.cse22 (mod v_prenex_24 299872))) (let ((.cse24 (+ .cse22 433281)) (.cse21 (* 10 .cse23))) (and (< v_prenex_23 600240) (<= c_~a17~0 (div (+ .cse21 10) 4)) (not (= (mod v_prenex_23 5) 0)) (<= (+ v_prenex_24 124) 0) (= .cse22 0) (= (mod (+ (* 2 .cse23) 2) 4) 0) (<= 0 .cse24) (<= v_prenex_23 (div .cse24 5)) (<= 0 .cse21)))))) (and (exists ((v_prenex_34 Int) (v_prenex_33 Int)) (let ((.cse26 (div (+ v_prenex_34 (- 600240)) 5)) (.cse28 (mod v_prenex_33 299872))) (let ((.cse25 (+ .cse28 433281)) (.cse27 (* 2 .cse26))) (and (<= 0 .cse25) (<= v_prenex_34 (div .cse25 5)) (<= c_~a17~0 (div (* 10 .cse26) 4)) (= 0 (mod .cse27 4)) (<= (+ v_prenex_33 124) 0) (= (mod v_prenex_34 5) 0) (= .cse28 0) (= (mod (+ .cse27 2) 4) 0))))) .cse0 .cse5 .cse6 .cse7) (and .cse0 .cse5 (exists ((v_prenex_44 Int) (v_prenex_43 Int)) (let ((.cse31 (mod v_prenex_43 299872)) (.cse33 (div (+ v_prenex_44 (- 600240)) 5))) (let ((.cse30 (* 2 .cse33)) (.cse29 (* 10 .cse33)) (.cse32 (+ .cse31 433281))) (and (= (mod v_prenex_44 5) 0) (< .cse29 0) (not (= (mod (+ .cse30 2) 4) 0)) (<= c_~a17~0 (+ (div .cse29 4) 1)) (not (= 0 (mod .cse30 4))) (<= (+ v_prenex_43 124) 0) (= .cse31 0) (< (+ .cse29 10) 0) (<= v_prenex_44 (div .cse32 5)) (<= 0 .cse32))))) .cse6 .cse7) (and .cse0 .cse5 .cse6 (exists ((v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse37 (div (+ v_prenex_32 (- 600240)) 5)) (.cse36 (mod v_prenex_31 299872))) (let ((.cse35 (+ .cse36 433281)) (.cse34 (* 10 .cse37))) (and (<= c_~a17~0 (+ (div .cse34 4) 1)) (<= v_prenex_32 (div .cse35 5)) (<= (+ v_prenex_31 124) 0) (<= 0 .cse35) (<= 0 (+ .cse34 10)) (= .cse36 0) (< .cse34 0) (not (= 0 (mod (* 2 .cse37) 4))) (= (mod v_prenex_32 5) 0))))) .cse7) (and .cse0 (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse42 (div (+ v_prenex_16 (- 600240)) 5)) (.cse39 (mod v_prenex_15 299872))) (let ((.cse40 (+ .cse39 433281)) (.cse41 (* 10 .cse42)) (.cse38 (* 2 .cse42))) (and (<= (+ v_prenex_15 124) 0) (= 0 (mod .cse38 4)) (= .cse39 0) (<= v_prenex_16 (div .cse40 5)) (<= 0 .cse40) (<= c_~a17~0 (div .cse41 4)) (= (mod v_prenex_16 5) 0) (< (+ .cse41 10) 0) (not (= (mod (+ .cse38 2) 4) 0)))))) .cse5 .cse6 .cse7) (and (exists ((v_prenex_12 Int) (v_prenex_11 Int)) (let ((.cse46 (div (+ v_prenex_12 (- 600240)) 5)) (.cse45 (mod v_prenex_11 299872))) (let ((.cse43 (+ .cse45 433281)) (.cse44 (* 10 .cse46))) (and (= (mod v_prenex_12 5) 0) (<= v_prenex_12 (div .cse43 5)) (<= c_~a17~0 (div .cse44 4)) (= .cse45 0) (<= (+ v_prenex_11 124) 0) (<= 0 .cse43) (= (mod (+ (* 2 .cse46) 2) 4) 0) (<= 0 .cse44))))) .cse0 .cse5 .cse6 .cse7) (and .cse0 (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse49 (div (+ v_prenex_42 (- 600240)) 5)) (.cse50 (mod v_prenex_41 299872))) (let ((.cse47 (+ .cse50 433281)) (.cse48 (* 10 .cse49))) (and (<= v_prenex_42 (div .cse47 5)) (<= c_~a17~0 (div .cse48 4)) (not (= (mod (+ (* 2 .cse49) 2) 4) 0)) (<= 600240 v_prenex_42) (<= 0 .cse47) (= .cse50 0) (< (+ .cse48 10) 0) (<= (+ v_prenex_41 124) 0) (<= 0 .cse48))))) .cse5 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse7 (exists ((v_prenex_27 Int) (v_prenex_28 Int)) (let ((.cse54 (mod v_prenex_28 299872)) (.cse55 (div (+ v_prenex_27 (- 600240)) 5))) (let ((.cse51 (* 2 .cse55)) (.cse52 (* 10 .cse55)) (.cse53 (+ .cse54 433281))) (and (not (= 0 (mod .cse51 4))) (< (+ .cse52 10) 0) (<= 600240 v_prenex_27) (<= 0 .cse53) (not (= (mod (+ .cse51 2) 4) 0)) (= .cse54 0) (<= (+ v_prenex_28 124) 0) (<= c_~a17~0 (+ (div .cse52 4) 1)) (< .cse52 0) (<= v_prenex_27 (div .cse53 5))))))) (and .cse0 .cse5 .cse6 (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse61 (div (+ v_prenex_10 (- 600240)) 5))) (let ((.cse60 (mod v_prenex_9 299872)) (.cse58 (* 10 .cse61))) (let ((.cse56 (+ .cse58 10)) (.cse59 (* 2 .cse61)) (.cse57 (+ .cse60 433281))) (and (<= (+ v_prenex_9 124) 0) (not (= (mod v_prenex_10 5) 0)) (<= c_~a17~0 (+ (div .cse56 4) 1)) (< .cse56 0) (<= 0 .cse57) (< .cse58 0) (not (= (mod (+ .cse59 2) 4) 0)) (not (= 0 (mod .cse59 4))) (= .cse60 0) (< v_prenex_10 600240) (<= v_prenex_10 (div .cse57 5))))))) .cse7) (and (exists ((v_prenex_56 Int) (v_prenex_55 Int)) (let ((.cse63 (div (+ v_prenex_56 (- 600240)) 5)) (.cse65 (mod v_prenex_55 299872))) (let ((.cse64 (+ .cse65 433281)) (.cse62 (* 2 .cse63))) (and (= (mod (+ .cse62 2) 4) 0) (<= c_~a17~0 (div (* 10 .cse63) 4)) (<= 600240 v_prenex_56) (<= 0 .cse64) (<= v_prenex_56 (div .cse64 5)) (= 0 (mod .cse62 4)) (<= (+ v_prenex_55 124) 0) (= .cse65 0))))) .cse0 .cse5 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse7 (exists ((v_prenex_45 Int) (v_prenex_46 Int)) (let ((.cse69 (mod v_prenex_45 299872)) (.cse68 (div (+ v_prenex_46 (- 600240)) 5))) (let ((.cse67 (* 10 .cse68)) (.cse66 (+ .cse69 433281))) (and (<= 0 .cse66) (<= 0 (+ .cse67 10)) (<= (+ v_prenex_45 124) 0) (<= c_~a17~0 (div .cse67 4)) (<= 600240 v_prenex_46) (<= v_prenex_46 (div .cse66 5)) (= 0 (mod (* 2 .cse68) 4)) (= .cse69 0)))))) (and .cse0 (exists ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse73 (mod v_prenex_59 299872)) (.cse74 (div (+ v_prenex_60 (- 600240)) 5))) (let ((.cse71 (* 2 .cse74)) (.cse72 (* 10 .cse74)) (.cse70 (+ .cse73 433281))) (and (<= 0 .cse70) (= (mod (+ .cse71 2) 4) 0) (<= c_~a17~0 (+ (div .cse72 4) 1)) (not (= 0 (mod .cse71 4))) (< .cse72 0) (= .cse73 0) (<= v_prenex_60 (div .cse70 5)) (<= 600240 v_prenex_60) (<= (+ v_prenex_59 124) 0))))) .cse5 .cse6 .cse7) (and .cse0 (exists ((v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse79 (div (+ v_prenex_36 (- 600240)) 5)) (.cse78 (mod v_prenex_35 299872))) (let ((.cse76 (+ .cse78 433281)) (.cse77 (* 10 .cse79)) (.cse75 (* 2 .cse79))) (and (not (= 0 (mod .cse75 4))) (<= v_prenex_36 (div .cse76 5)) (<= 0 .cse76) (< .cse77 0) (<= c_~a17~0 (+ (div .cse77 4) 1)) (<= (+ v_prenex_35 124) 0) (= .cse78 0) (= (mod v_prenex_36 5) 0) (= (mod (+ .cse75 2) 4) 0))))) .cse5 .cse6 .cse7) (and .cse0 .cse5 (exists ((v_prenex_52 Int) (v_prenex_51 Int)) (let ((.cse83 (mod v_prenex_51 299872)) (.cse84 (div (+ v_prenex_52 (- 600240)) 5))) (let ((.cse82 (* 2 .cse84)) (.cse80 (+ .cse83 433281)) (.cse81 (+ (* 10 .cse84) 10))) (and (<= v_prenex_52 (div .cse80 5)) (< v_prenex_52 600240) (< .cse81 0) (= 0 (mod .cse82 4)) (not (= (mod (+ .cse82 2) 4) 0)) (<= (+ v_prenex_51 124) 0) (<= 0 .cse80) (<= c_~a17~0 (+ (div .cse81 4) 1)) (= .cse83 0) (not (= (mod v_prenex_52 5) 0)))))) .cse6 .cse7) (and .cse0 .cse5 .cse6 (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (let ((.cse87 (div (+ v_prenex_38 (- 600240)) 5)) (.cse88 (mod v_prenex_37 299872))) (let ((.cse86 (+ .cse88 433281)) (.cse85 (* 10 .cse87))) (and (<= 0 (+ .cse85 10)) (<= 0 .cse86) (<= c_~a17~0 (+ (div .cse85 4) 1)) (<= 600240 v_prenex_38) (<= v_prenex_38 (div .cse86 5)) (< .cse85 0) (not (= 0 (mod (* 2 .cse87) 4))) (= .cse88 0) (<= (+ v_prenex_37 124) 0))))) .cse7) (and .cse0 .cse5 .cse6 .cse7 (exists ((v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse91 (div (+ v_prenex_21 (- 600240)) 5)) (.cse90 (mod v_prenex_22 299872))) (let ((.cse92 (+ .cse90 433281)) (.cse89 (* 2 .cse91))) (and (= 0 (mod .cse89 4)) (= .cse90 0) (<= (+ v_prenex_22 124) 0) (< v_prenex_21 600240) (<= c_~a17~0 (div (+ (* 10 .cse91) 10) 4)) (<= v_prenex_21 (div .cse92 5)) (<= 0 .cse92) (not (= (mod v_prenex_21 5) 0)) (= (mod (+ .cse89 2) 4) 0)))))) (and .cse0 .cse5 (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse95 (mod v_prenex_13 299872)) (.cse96 (div (+ v_prenex_14 (- 600240)) 5))) (let ((.cse93 (* 10 .cse96)) (.cse94 (+ .cse95 433281))) (and (<= 0 (+ .cse93 10)) (<= c_~a17~0 (div .cse93 4)) (<= (+ v_prenex_13 124) 0) (= (mod v_prenex_14 5) 0) (<= 0 .cse94) (<= v_prenex_14 (div .cse94 5)) (= .cse95 0) (= 0 (mod (* 2 .cse96) 4)))))) .cse6 .cse7) (and .cse0 (exists ((v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse98 (div (+ v_prenex_25 (- 600240)) 5)) (.cse99 (mod v_prenex_26 299872))) (let ((.cse97 (+ .cse99 433281)) (.cse100 (* 10 .cse98))) (and (<= v_prenex_25 (div .cse97 5)) (= (mod (+ (* 2 .cse98) 2) 4) 0) (<= (+ v_prenex_26 124) 0) (= .cse99 0) (<= 600240 v_prenex_25) (<= 0 .cse100) (<= 0 .cse97) (<= c_~a17~0 (div .cse100 4)))))) .cse5 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse7 (exists ((v_prenex_39 Int) (v_prenex_40 Int)) (let ((.cse104 (mod v_prenex_39 299872)) (.cse102 (div (+ v_prenex_40 (- 600240)) 5))) (let ((.cse101 (* 10 .cse102)) (.cse103 (+ .cse104 433281))) (and (= (mod v_prenex_40 5) 0) (<= c_~a17~0 (div .cse101 4)) (not (= (mod (+ (* 2 .cse102) 2) 4) 0)) (<= v_prenex_40 (div .cse103 5)) (< (+ .cse101 10) 0) (= .cse104 0) (<= 0 .cse101) (<= 0 .cse103) (<= (+ v_prenex_39 124) 0)))))) (and (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse107 (div (+ v_prenex_18 (- 600240)) 5)) (.cse105 (mod v_prenex_17 299872))) (let ((.cse106 (+ .cse105 433281)) (.cse108 (+ (* 10 .cse107) 10))) (and (= .cse105 0) (<= v_prenex_18 (div .cse106 5)) (not (= (mod v_prenex_18 5) 0)) (= 0 (mod (* 2 .cse107) 4)) (<= c_~a17~0 (div .cse108 4)) (< v_prenex_18 600240) (<= (+ v_prenex_17 124) 0) (<= 0 .cse106) (<= 0 .cse108))))) .cse0 .cse5 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse7 (exists ((v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse111 (mod v_prenex_20 299872))) (let ((.cse110 (+ .cse111 433281)) (.cse109 (* 10 (div (+ v_prenex_19 (- 600240)) 5)))) (and (<= 0 (+ .cse109 10)) (<= c_~a17~0 (div .cse109 4)) (<= 0 .cse110) (<= v_prenex_19 (div .cse110 5)) (<= 600240 v_prenex_19) (= .cse111 0) (<= (+ v_prenex_20 124) 0) (<= 0 .cse109)))))) (and .cse0 .cse5 .cse6 (exists ((v_prenex_49 Int) (v_prenex_50 Int)) (let ((.cse115 (div (+ v_prenex_50 (- 600240)) 5))) (let ((.cse116 (mod v_prenex_49 299872)) (.cse113 (* 10 .cse115))) (let ((.cse114 (+ .cse113 10)) (.cse112 (+ .cse116 433281))) (and (<= 0 .cse112) (<= (+ v_prenex_49 124) 0) (<= 0 .cse113) (< .cse114 0) (< v_prenex_50 600240) (not (= (mod (+ (* 2 .cse115) 2) 4) 0)) (= .cse116 0) (<= c_~a17~0 (+ (div .cse114 4) 1)) (not (= (mod v_prenex_50 5) 0)) (<= v_prenex_50 (div .cse112 5))))))) .cse7) (and .cse0 (exists ((v_prenex_6 Int) (v_~a17~0_2054 Int)) (let ((.cse119 (div (+ v_~a17~0_2054 (- 600240)) 5))) (let ((.cse121 (* 10 .cse119)) (.cse117 (mod v_prenex_6 299872))) (let ((.cse118 (+ .cse117 433281)) (.cse120 (+ .cse121 10))) (and (= .cse117 0) (<= v_~a17~0_2054 (div .cse118 5)) (<= (+ v_prenex_6 124) 0) (< v_~a17~0_2054 600240) (not (= (mod v_~a17~0_2054 5) 0)) (not (= 0 (mod (* 2 .cse119) 4))) (<= 0 .cse118) (<= 0 .cse120) (< .cse121 0) (<= c_~a17~0 (div .cse120 4))))))) .cse5 .cse6 .cse7))) is different from false Received shutdown request... [2018-10-24 14:04:12,841 WARN L187 SmtUtils]: Removed 45 from assertion stack [2018-10-24 14:04:12,841 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 14:04:13,043 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:04:13,044 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:04:13,048 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:04:13,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:04:13 BoogieIcfgContainer [2018-10-24 14:04:13,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:04:13,050 INFO L168 Benchmark]: Toolchain (without parser) took 226673.66 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 570.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:13,051 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:04:13,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2022.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:13,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 614.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 752.4 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -954.7 MB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:13,053 INFO L168 Benchmark]: Boogie Preprocessor took 337.25 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:13,054 INFO L168 Benchmark]: RCFGBuilder took 9100.82 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 234.4 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -192.9 MB). Peak memory consumption was 627.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:13,055 INFO L168 Benchmark]: TraceAbstraction took 214593.61 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.5 GB). Free memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: -999.0 MB). Peak memory consumption was 476.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:04:13,060 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2022.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 614.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 752.4 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -954.7 MB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 337.25 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9100.82 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 234.4 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -192.9 MB). Peak memory consumption was 627.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 214593.61 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.5 GB). Free memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: -999.0 MB). Peak memory consumption was 476.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 985 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 860. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 214.5s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 138.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7782 SDtfs, 25326 SDslu, 1355 SDs, 0 SdLazy, 73951 SolverSat, 12620 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 113.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1021 GetRequests, 966 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151214occurred in iteration=9, 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: 12.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 61004 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 6048 NumberOfCodeBlocks, 6048 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 6033 ConstructedInterpolants, 0 QuantifiedInterpolants, 7940239 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1250 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 4767/4955 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown