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/Problem16_label01_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:26:08,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:26:08,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:26:08,296 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:26:08,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:26:08,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:26:08,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:26:08,300 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:26:08,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:26:08,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:26:08,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:26:08,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:26:08,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:26:08,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:26:08,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:26:08,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:26:08,308 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:26:08,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:26:08,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:26:08,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:26:08,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:26:08,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:26:08,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:26:08,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:26:08,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:26:08,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:26:08,321 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:26:08,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:26:08,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:26:08,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:26:08,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:26:08,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:26:08,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:26:08,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:26:08,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:26:08,328 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:26:08,328 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 19:26:08,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:26:08,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:26:08,346 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:26:08,346 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:26:08,347 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:26:08,347 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:26:08,347 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:26:08,347 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:26:08,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:26:08,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:26:08,348 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:26:08,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:26:08,348 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:26:08,348 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:26:08,349 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:26:08,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:26:08,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:26:08,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:26:08,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:26:08,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:26:08,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:26:08,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:26:08,350 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:26:08,351 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:26:08,351 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:26:08,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:26:08,351 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:26:08,351 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:26:08,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:26:08,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:26:08,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:26:08,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:26:08,417 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:26:08,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label01_false-unreach-call.c [2018-10-26 19:26:08,485 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/28c80ef3f/0bdba22cf8f04f3ca9476dc44cbb6427/FLAGe12bca68b [2018-10-26 19:26:09,213 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:26:09,215 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label01_false-unreach-call.c [2018-10-26 19:26:09,234 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/28c80ef3f/0bdba22cf8f04f3ca9476dc44cbb6427/FLAGe12bca68b [2018-10-26 19:26:09,253 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/28c80ef3f/0bdba22cf8f04f3ca9476dc44cbb6427 [2018-10-26 19:26:09,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:26:09,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:26:09,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:26:09,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:26:09,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:26:09,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:26:09" (1/1) ... [2018-10-26 19:26:09,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f32220e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:09, skipping insertion in model container [2018-10-26 19:26:09,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:26:09" (1/1) ... [2018-10-26 19:26:09,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:26:09,389 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:26:10,160 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:26:10,165 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:26:10,485 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:26:10,509 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:26:10,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10 WrapperNode [2018-10-26 19:26:10,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:26:10,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:26:10,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:26:10,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:26:10,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... [2018-10-26 19:26:10,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... [2018-10-26 19:26:10,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:26:10,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:26:10,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:26:10,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:26:10,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... [2018-10-26 19:26:10,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... [2018-10-26 19:26:10,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... [2018-10-26 19:26:10,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... [2018-10-26 19:26:10,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... [2018-10-26 19:26:10,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... [2018-10-26 19:26:11,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... [2018-10-26 19:26:11,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:26:11,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:26:11,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:26:11,067 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:26:11,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:26:11,136 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:26:11,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:26:11,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:26:17,305 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:26:17,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:26:17 BoogieIcfgContainer [2018-10-26 19:26:17,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:26:17,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:26:17,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:26:17,311 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:26:17,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:26:09" (1/3) ... [2018-10-26 19:26:17,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58198df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:26:17, skipping insertion in model container [2018-10-26 19:26:17,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:26:10" (2/3) ... [2018-10-26 19:26:17,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58198df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:26:17, skipping insertion in model container [2018-10-26 19:26:17,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:26:17" (3/3) ... [2018-10-26 19:26:17,315 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label01_false-unreach-call.c [2018-10-26 19:26:17,327 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:26:17,335 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:26:17,353 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:26:17,393 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:26:17,394 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:26:17,394 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:26:17,394 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:26:17,395 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:26:17,395 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:26:17,395 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:26:17,395 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:26:17,395 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:26:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states. [2018-10-26 19:26:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:26:17,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:17,438 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:26:17,440 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:17,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1740446778, now seen corresponding path program 1 times [2018-10-26 19:26:17,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:17,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:17,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:17,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:17,845 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:26:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:17,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:17,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:17,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:26:17,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:26:17,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:17,881 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 4 states. [2018-10-26 19:26:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:24,108 INFO L93 Difference]: Finished difference Result 1458 states and 2766 transitions. [2018-10-26 19:26:24,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:26:24,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-26 19:26:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:24,141 INFO L225 Difference]: With dead ends: 1458 [2018-10-26 19:26:24,141 INFO L226 Difference]: Without dead ends: 1054 [2018-10-26 19:26:24,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-10-26 19:26:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2018-10-26 19:26:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-10-26 19:26:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1744 transitions. [2018-10-26 19:26:24,258 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1744 transitions. Word has length 27 [2018-10-26 19:26:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:24,259 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1744 transitions. [2018-10-26 19:26:24,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:26:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1744 transitions. [2018-10-26 19:26:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-26 19:26:24,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:24,263 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:26:24,264 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:24,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2021507458, now seen corresponding path program 1 times [2018-10-26 19:26:24,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:24,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:24,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:24,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:24,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:26:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:26:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:24,677 INFO L87 Difference]: Start difference. First operand 1054 states and 1744 transitions. Second operand 4 states. [2018-10-26 19:26:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:30,170 INFO L93 Difference]: Finished difference Result 4101 states and 6863 transitions. [2018-10-26 19:26:30,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:26:30,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-10-26 19:26:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:30,188 INFO L225 Difference]: With dead ends: 4101 [2018-10-26 19:26:30,189 INFO L226 Difference]: Without dead ends: 3049 [2018-10-26 19:26:30,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2018-10-26 19:26:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2044. [2018-10-26 19:26:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-10-26 19:26:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3225 transitions. [2018-10-26 19:26:30,252 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3225 transitions. Word has length 99 [2018-10-26 19:26:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:30,253 INFO L481 AbstractCegarLoop]: Abstraction has 2044 states and 3225 transitions. [2018-10-26 19:26:30,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:26:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3225 transitions. [2018-10-26 19:26:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 19:26:30,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:30,267 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:26:30,267 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:30,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash -183471256, now seen corresponding path program 1 times [2018-10-26 19:26:30,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:30,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:30,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:30,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:30,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 19:26:30,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:30,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:30,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:26:30,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:26:30,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:30,643 INFO L87 Difference]: Start difference. First operand 2044 states and 3225 transitions. Second operand 4 states. [2018-10-26 19:26:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:37,432 INFO L93 Difference]: Finished difference Result 5076 states and 7873 transitions. [2018-10-26 19:26:37,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:26:37,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-10-26 19:26:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:37,449 INFO L225 Difference]: With dead ends: 5076 [2018-10-26 19:26:37,450 INFO L226 Difference]: Without dead ends: 3034 [2018-10-26 19:26:37,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2018-10-26 19:26:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 3034. [2018-10-26 19:26:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2018-10-26 19:26:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4326 transitions. [2018-10-26 19:26:37,516 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4326 transitions. Word has length 183 [2018-10-26 19:26:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:37,516 INFO L481 AbstractCegarLoop]: Abstraction has 3034 states and 4326 transitions. [2018-10-26 19:26:37,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:26:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4326 transitions. [2018-10-26 19:26:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 19:26:37,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:37,522 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:26:37,523 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:37,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:37,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1718720518, now seen corresponding path program 1 times [2018-10-26 19:26:37,523 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:37,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:37,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:37,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:37,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 19:26:37,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:37,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:26:37,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:37,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:37,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:37,821 INFO L87 Difference]: Start difference. First operand 3034 states and 4326 transitions. Second operand 3 states. [2018-10-26 19:26:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:40,669 INFO L93 Difference]: Finished difference Result 7386 states and 10730 transitions. [2018-10-26 19:26:40,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:40,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-10-26 19:26:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:40,691 INFO L225 Difference]: With dead ends: 7386 [2018-10-26 19:26:40,691 INFO L226 Difference]: Without dead ends: 4354 [2018-10-26 19:26:40,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2018-10-26 19:26:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 4354. [2018-10-26 19:26:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4354 states. [2018-10-26 19:26:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 5878 transitions. [2018-10-26 19:26:40,787 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 5878 transitions. Word has length 195 [2018-10-26 19:26:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:40,788 INFO L481 AbstractCegarLoop]: Abstraction has 4354 states and 5878 transitions. [2018-10-26 19:26:40,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 5878 transitions. [2018-10-26 19:26:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-26 19:26:40,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:40,792 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:26:40,793 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:40,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash 918300432, now seen corresponding path program 1 times [2018-10-26 19:26:40,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:40,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:40,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:40,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:40,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:41,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:41,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:41,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:26:41,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:26:41,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:41,274 INFO L87 Difference]: Start difference. First operand 4354 states and 5878 transitions. Second operand 4 states. [2018-10-26 19:26:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:45,049 INFO L93 Difference]: Finished difference Result 15966 states and 21694 transitions. [2018-10-26 19:26:45,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:26:45,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-10-26 19:26:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:45,094 INFO L225 Difference]: With dead ends: 15966 [2018-10-26 19:26:45,095 INFO L226 Difference]: Without dead ends: 11614 [2018-10-26 19:26:45,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11614 states. [2018-10-26 19:26:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11614 to 11614. [2018-10-26 19:26:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11614 states. [2018-10-26 19:26:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11614 states to 11614 states and 14516 transitions. [2018-10-26 19:26:45,306 INFO L78 Accepts]: Start accepts. Automaton has 11614 states and 14516 transitions. Word has length 207 [2018-10-26 19:26:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:45,307 INFO L481 AbstractCegarLoop]: Abstraction has 11614 states and 14516 transitions. [2018-10-26 19:26:45,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:26:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 11614 states and 14516 transitions. [2018-10-26 19:26:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-26 19:26:45,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:45,317 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:26:45,317 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:45,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:45,318 INFO L82 PathProgramCache]: Analyzing trace with hash 140112663, now seen corresponding path program 1 times [2018-10-26 19:26:45,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:45,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:45,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:45,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:45,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:45,776 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 19:26:45,993 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-10-26 19:26:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 19:26:46,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:46,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:26:46,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:26:46,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:26:46,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:26:46,526 INFO L87 Difference]: Start difference. First operand 11614 states and 14516 transitions. Second operand 7 states. [2018-10-26 19:26:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:51,485 INFO L93 Difference]: Finished difference Result 23567 states and 29384 transitions. [2018-10-26 19:26:51,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:26:51,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 381 [2018-10-26 19:26:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:51,525 INFO L225 Difference]: With dead ends: 23567 [2018-10-26 19:26:51,525 INFO L226 Difference]: Without dead ends: 11955 [2018-10-26 19:26:51,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:26:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11955 states. [2018-10-26 19:26:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11955 to 11944. [2018-10-26 19:26:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11944 states. [2018-10-26 19:26:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11944 states to 11944 states and 14852 transitions. [2018-10-26 19:26:51,702 INFO L78 Accepts]: Start accepts. Automaton has 11944 states and 14852 transitions. Word has length 381 [2018-10-26 19:26:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:51,703 INFO L481 AbstractCegarLoop]: Abstraction has 11944 states and 14852 transitions. [2018-10-26 19:26:51,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:26:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 11944 states and 14852 transitions. [2018-10-26 19:26:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-26 19:26:51,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:51,714 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:26:51,714 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:51,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash -469753230, now seen corresponding path program 1 times [2018-10-26 19:26:51,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:51,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:51,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:51,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:51,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-26 19:26:52,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:26:52,400 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:26:52,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:52,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:26:53,221 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 23 [2018-10-26 19:26:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 203 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:53,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:26:53,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-26 19:26:53,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 19:26:53,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 19:26:53,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:26:53,969 INFO L87 Difference]: Start difference. First operand 11944 states and 14852 transitions. Second operand 8 states. [2018-10-26 19:27:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:08,639 INFO L93 Difference]: Finished difference Result 35798 states and 43591 transitions. [2018-10-26 19:27:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 19:27:08,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 443 [2018-10-26 19:27:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:08,683 INFO L225 Difference]: With dead ends: 35798 [2018-10-26 19:27:08,684 INFO L226 Difference]: Without dead ends: 24186 [2018-10-26 19:27:08,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:27:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24186 states. [2018-10-26 19:27:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24186 to 22202. [2018-10-26 19:27:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22202 states. [2018-10-26 19:27:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22202 states to 22202 states and 26472 transitions. [2018-10-26 19:27:09,079 INFO L78 Accepts]: Start accepts. Automaton has 22202 states and 26472 transitions. Word has length 443 [2018-10-26 19:27:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:09,080 INFO L481 AbstractCegarLoop]: Abstraction has 22202 states and 26472 transitions. [2018-10-26 19:27:09,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 19:27:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 22202 states and 26472 transitions. [2018-10-26 19:27:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-26 19:27:09,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:09,099 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:09,099 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:09,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:09,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1923592839, now seen corresponding path program 1 times [2018-10-26 19:27:09,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:09,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:09,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:09,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:09,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:09,751 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 19:27:10,069 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 19:27:10,439 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-10-26 19:27:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-26 19:27:10,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:27:10,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:27:10,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:27:10,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:27:10,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:27:10,640 INFO L87 Difference]: Start difference. First operand 22202 states and 26472 transitions. Second operand 7 states. [2018-10-26 19:27:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:15,732 INFO L93 Difference]: Finished difference Result 44042 states and 52582 transitions. [2018-10-26 19:27:15,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:27:15,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 469 [2018-10-26 19:27:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:15,774 INFO L225 Difference]: With dead ends: 44042 [2018-10-26 19:27:15,775 INFO L226 Difference]: Without dead ends: 20263 [2018-10-26 19:27:15,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:27:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20263 states. [2018-10-26 19:27:16,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20263 to 20243. [2018-10-26 19:27:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20243 states. [2018-10-26 19:27:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20243 states to 20243 states and 22395 transitions. [2018-10-26 19:27:16,387 INFO L78 Accepts]: Start accepts. Automaton has 20243 states and 22395 transitions. Word has length 469 [2018-10-26 19:27:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:16,387 INFO L481 AbstractCegarLoop]: Abstraction has 20243 states and 22395 transitions. [2018-10-26 19:27:16,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:27:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 20243 states and 22395 transitions. [2018-10-26 19:27:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-10-26 19:27:16,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:16,404 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:16,404 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:16,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:16,405 INFO L82 PathProgramCache]: Analyzing trace with hash -469351966, now seen corresponding path program 1 times [2018-10-26 19:27:16,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:16,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:16,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:16,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:16,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 19:27:16,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:27:16,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:27:16,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:27:16,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:27:16,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:27:16,961 INFO L87 Difference]: Start difference. First operand 20243 states and 22395 transitions. Second operand 4 states. [2018-10-26 19:27:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:21,088 INFO L93 Difference]: Finished difference Result 46753 states and 51833 transitions. [2018-10-26 19:27:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:27:21,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 531 [2018-10-26 19:27:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:21,131 INFO L225 Difference]: With dead ends: 46753 [2018-10-26 19:27:21,132 INFO L226 Difference]: Without dead ends: 26842 [2018-10-26 19:27:21,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:27:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26842 states. [2018-10-26 19:27:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26842 to 26842. [2018-10-26 19:27:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26842 states. [2018-10-26 19:27:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26842 states to 26842 states and 28921 transitions. [2018-10-26 19:27:21,440 INFO L78 Accepts]: Start accepts. Automaton has 26842 states and 28921 transitions. Word has length 531 [2018-10-26 19:27:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:21,441 INFO L481 AbstractCegarLoop]: Abstraction has 26842 states and 28921 transitions. [2018-10-26 19:27:21,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:27:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 26842 states and 28921 transitions. [2018-10-26 19:27:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-10-26 19:27:21,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:21,449 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:21,449 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:21,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:21,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1150264802, now seen corresponding path program 1 times [2018-10-26 19:27:21,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:21,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:21,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:21,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:21,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:27:22,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:22,689 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:22,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:22,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:25,116 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-10-26 19:27:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 267 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:27:25,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:27:25,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-26 19:27:25,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 19:27:25,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 19:27:25,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:27:25,554 INFO L87 Difference]: Start difference. First operand 26842 states and 28921 transitions. Second operand 8 states. [2018-10-26 19:27:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:32,573 INFO L93 Difference]: Finished difference Result 54062 states and 58230 transitions. [2018-10-26 19:27:32,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 19:27:32,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 540 [2018-10-26 19:27:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:32,605 INFO L225 Difference]: With dead ends: 54062 [2018-10-26 19:27:32,606 INFO L226 Difference]: Without dead ends: 27502 [2018-10-26 19:27:32,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:27:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27502 states. [2018-10-26 19:27:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27502 to 26842. [2018-10-26 19:27:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26842 states. [2018-10-26 19:27:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26842 states to 26842 states and 28917 transitions. [2018-10-26 19:27:32,931 INFO L78 Accepts]: Start accepts. Automaton has 26842 states and 28917 transitions. Word has length 540 [2018-10-26 19:27:32,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:32,932 INFO L481 AbstractCegarLoop]: Abstraction has 26842 states and 28917 transitions. [2018-10-26 19:27:32,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 19:27:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 26842 states and 28917 transitions. [2018-10-26 19:27:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-10-26 19:27:32,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:32,945 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:32,946 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:32,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1697773299, now seen corresponding path program 1 times [2018-10-26 19:27:32,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:32,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:32,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:32,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:32,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-10-26 19:27:33,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:27:33,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:27:33,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:27:33,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:27:33,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:27:33,740 INFO L87 Difference]: Start difference. First operand 26842 states and 28917 transitions. Second operand 4 states. [2018-10-26 19:27:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:36,151 INFO L93 Difference]: Finished difference Result 57972 states and 62542 transitions. [2018-10-26 19:27:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:27:36,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 625 [2018-10-26 19:27:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:36,174 INFO L225 Difference]: With dead ends: 57972 [2018-10-26 19:27:36,175 INFO L226 Difference]: Without dead ends: 31462 [2018-10-26 19:27:36,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:27:36,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31462 states. [2018-10-26 19:27:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31462 to 31132. [2018-10-26 19:27:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31132 states. [2018-10-26 19:27:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31132 states to 31132 states and 32795 transitions. [2018-10-26 19:27:36,459 INFO L78 Accepts]: Start accepts. Automaton has 31132 states and 32795 transitions. Word has length 625 [2018-10-26 19:27:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:36,460 INFO L481 AbstractCegarLoop]: Abstraction has 31132 states and 32795 transitions. [2018-10-26 19:27:36,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:27:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 31132 states and 32795 transitions. [2018-10-26 19:27:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-26 19:27:36,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:36,472 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:27:36,472 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:36,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:36,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1509522246, now seen corresponding path program 1 times [2018-10-26 19:27:36,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:36,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:36,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:36,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 396 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:27:37,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:37,729 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:37,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:37,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:39,823 WARN L179 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 490 DAG size of output: 32 [2018-10-26 19:27:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 574 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:27:40,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:27:40,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-26 19:27:40,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 19:27:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 19:27:40,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:27:40,362 INFO L87 Difference]: Start difference. First operand 31132 states and 32795 transitions. Second operand 8 states. [2018-10-26 19:27:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:27:52,996 INFO L93 Difference]: Finished difference Result 87446 states and 92396 transitions. [2018-10-26 19:27:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 19:27:52,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 699 [2018-10-26 19:27:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:27:53,052 INFO L225 Difference]: With dead ends: 87446 [2018-10-26 19:27:53,052 INFO L226 Difference]: Without dead ends: 56621 [2018-10-26 19:27:53,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 699 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:27:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56621 states. [2018-10-26 19:27:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56621 to 47984. [2018-10-26 19:27:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47984 states. [2018-10-26 19:27:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47984 states to 47984 states and 50229 transitions. [2018-10-26 19:27:53,533 INFO L78 Accepts]: Start accepts. Automaton has 47984 states and 50229 transitions. Word has length 699 [2018-10-26 19:27:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:27:53,534 INFO L481 AbstractCegarLoop]: Abstraction has 47984 states and 50229 transitions. [2018-10-26 19:27:53,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 19:27:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 47984 states and 50229 transitions. [2018-10-26 19:27:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-10-26 19:27:53,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:27:53,547 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:27:53,548 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:27:53,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:27:53,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1277818903, now seen corresponding path program 1 times [2018-10-26 19:27:53,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:27:53,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:27:53,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:53,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:27:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:54,127 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-26 19:27:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 451 proven. 14 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-10-26 19:27:54,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:27:54,661 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:27:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:27:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:27:54,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-10-26 19:27:56,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:27:56,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-10-26 19:27:56,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:27:56,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:27:56,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:27:56,154 INFO L87 Difference]: Start difference. First operand 47984 states and 50229 transitions. Second operand 7 states. [2018-10-26 19:28:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:28:03,184 INFO L93 Difference]: Finished difference Result 99663 states and 104286 transitions. [2018-10-26 19:28:03,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 19:28:03,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 713 [2018-10-26 19:28:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:28:03,243 INFO L225 Difference]: With dead ends: 99663 [2018-10-26 19:28:03,244 INFO L226 Difference]: Without dead ends: 50635 [2018-10-26 19:28:03,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:28:03,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50635 states. [2018-10-26 19:28:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50635 to 47321. [2018-10-26 19:28:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47321 states. [2018-10-26 19:28:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47321 states to 47321 states and 49503 transitions. [2018-10-26 19:28:03,762 INFO L78 Accepts]: Start accepts. Automaton has 47321 states and 49503 transitions. Word has length 713 [2018-10-26 19:28:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:28:03,763 INFO L481 AbstractCegarLoop]: Abstraction has 47321 states and 49503 transitions. [2018-10-26 19:28:03,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:28:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 47321 states and 49503 transitions. [2018-10-26 19:28:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2018-10-26 19:28:03,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:28:03,776 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 19:28:03,777 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:28:03,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:28:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash 416114943, now seen corresponding path program 1 times [2018-10-26 19:28:03,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:28:03,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:28:03,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:28:03,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:28:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:28:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:28:04,525 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 19:28:04,808 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-10-26 19:28:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 80 proven. 516 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-26 19:28:06,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:28:06,523 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:28:06,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:28:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:28:06,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:28:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-26 19:28:07,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:28:07,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-26 19:28:07,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 19:28:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 19:28:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:28:07,852 INFO L87 Difference]: Start difference. First operand 47321 states and 49503 transitions. Second operand 12 states. [2018-10-26 19:28:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:28:15,499 INFO L93 Difference]: Finished difference Result 106591 states and 111290 transitions. [2018-10-26 19:28:15,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 19:28:15,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 746 [2018-10-26 19:28:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:28:15,549 INFO L225 Difference]: With dead ends: 106591 [2018-10-26 19:28:15,549 INFO L226 Difference]: Without dead ends: 59602 [2018-10-26 19:28:15,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 744 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-10-26 19:28:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59602 states. [2018-10-26 19:28:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59602 to 47722. [2018-10-26 19:28:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47722 states. [2018-10-26 19:28:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47722 states to 47722 states and 49669 transitions. [2018-10-26 19:28:15,980 INFO L78 Accepts]: Start accepts. Automaton has 47722 states and 49669 transitions. Word has length 746 [2018-10-26 19:28:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:28:15,981 INFO L481 AbstractCegarLoop]: Abstraction has 47722 states and 49669 transitions. [2018-10-26 19:28:15,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 19:28:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 47722 states and 49669 transitions. [2018-10-26 19:28:15,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-26 19:28:15,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:28:15,989 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:28:15,990 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:28:15,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:28:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash -800105641, now seen corresponding path program 1 times [2018-10-26 19:28:15,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:28:15,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:28:15,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:28:15,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:28:15,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:28:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:28:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 691 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:28:17,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:28:17,109 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:28:17,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:28:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:28:17,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:28:18,901 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_~a18~0_904 Int)) (let ((.cse0 (mod v_~a18~0_904 299932))) (and (= (mod (+ .cse0 4) 5) 0) (not (= 0 .cse0)) (<= c_~a18~0 (* 5 (div (+ .cse0 134) 5))) (< v_~a18~0_904 0)))) (exists ((v_prenex_65 Int)) (let ((.cse2 (mod v_prenex_65 299932))) (let ((.cse1 (+ .cse2 134))) (and (<= c_~a18~0 (+ (* 5 (div .cse1 5)) 5)) (< v_prenex_65 0) (< .cse1 0) (not (= 0 .cse2)) (not (= (mod (+ .cse2 4) 5) 0)))))) (exists ((v_prenex_63 Int)) (let ((.cse3 (mod v_prenex_63 299932))) (let ((.cse4 (+ .cse3 300066))) (and (= 0 .cse3) (<= 0 .cse4) (<= c_~a18~0 (* 5 (div .cse4 5))))))) (exists ((v_prenex_69 Int)) (let ((.cse6 (mod v_prenex_69 299932))) (let ((.cse5 (+ .cse6 134))) (and (<= c_~a18~0 (* 5 (div .cse5 5))) (< v_prenex_69 0) (<= 0 .cse5) (not (= 0 .cse6)))))) (exists ((v_prenex_64 Int)) (let ((.cse7 (mod v_prenex_64 299932))) (and (= 0 (mod (+ .cse7 1) 5)) (= 0 .cse7) (<= c_~a18~0 (* 5 (div (+ .cse7 300066) 5)))))) (exists ((v_prenex_68 Int)) (let ((.cse8 (+ (mod v_prenex_68 299932) 300066))) (and (<= c_~a18~0 (* 5 (div .cse8 5))) (<= 0 .cse8) (<= 0 v_prenex_68)))) (exists ((v_prenex_70 Int)) (let ((.cse10 (mod v_prenex_70 299932))) (let ((.cse9 (+ .cse10 300066))) (and (< .cse9 0) (not (= 0 (mod (+ .cse10 1) 5))) (<= c_~a18~0 (+ (* 5 (div .cse9 5)) 5)) (= 0 .cse10))))) (exists ((v_prenex_67 Int)) (let ((.cse11 (mod v_prenex_67 299932))) (and (<= 0 v_prenex_67) (= 0 (mod (+ .cse11 1) 5)) (<= c_~a18~0 (* 5 (div (+ .cse11 300066) 5)))))) (exists ((v_prenex_66 Int)) (let ((.cse13 (mod v_prenex_66 299932))) (let ((.cse12 (+ .cse13 300066))) (and (< .cse12 0) (<= 0 v_prenex_66) (not (= 0 (mod (+ .cse13 1) 5))) (<= c_~a18~0 (+ (* 5 (div .cse12 5)) 5))))))) is different from true [2018-10-26 19:28:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 25 not checked. [2018-10-26 19:28:25,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:28:25,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-10-26 19:28:25,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:28:25,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:28:25,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2018-10-26 19:28:25,185 INFO L87 Difference]: Start difference. First operand 47722 states and 49669 transitions. Second operand 9 states. [2018-10-26 19:28:42,777 WARN L179 SmtUtils]: Spent 12.78 s on a formula simplification. DAG size of input: 131 DAG size of output: 18 [2018-10-26 19:28:59,863 WARN L179 SmtUtils]: Spent 13.02 s on a formula simplification. DAG size of input: 129 DAG size of output: 18 [2018-10-26 19:29:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:29:04,578 INFO L93 Difference]: Finished difference Result 108316 states and 112638 transitions. [2018-10-26 19:29:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 19:29:04,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 749 [2018-10-26 19:29:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:29:04,652 INFO L225 Difference]: With dead ends: 108316 [2018-10-26 19:29:04,652 INFO L226 Difference]: Without dead ends: 60875 [2018-10-26 19:29:04,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 750 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=4, NotChecked=18, Total=132 [2018-10-26 19:29:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60875 states. [2018-10-26 19:29:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60875 to 54446. [2018-10-26 19:29:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54446 states. [2018-10-26 19:29:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54446 states to 54446 states and 56550 transitions. [2018-10-26 19:29:05,249 INFO L78 Accepts]: Start accepts. Automaton has 54446 states and 56550 transitions. Word has length 749 [2018-10-26 19:29:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:29:05,250 INFO L481 AbstractCegarLoop]: Abstraction has 54446 states and 56550 transitions. [2018-10-26 19:29:05,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:29:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 54446 states and 56550 transitions. [2018-10-26 19:29:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2018-10-26 19:29:05,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:29:05,260 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:29:05,261 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:29:05,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:29:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1153701064, now seen corresponding path program 1 times [2018-10-26 19:29:05,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:29:05,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:29:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:05,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:05,824 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 19:29:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 545 proven. 235 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 19:29:07,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:29:07,433 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:29:07,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:07,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:29:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 780 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 19:29:08,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:29:08,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-26 19:29:08,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 19:29:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 19:29:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:29:08,723 INFO L87 Difference]: Start difference. First operand 54446 states and 56550 transitions. Second operand 11 states. [2018-10-26 19:29:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:29:20,577 INFO L93 Difference]: Finished difference Result 154115 states and 159942 transitions. [2018-10-26 19:29:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 19:29:20,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 813 [2018-10-26 19:29:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:29:20,677 INFO L225 Difference]: With dead ends: 154115 [2018-10-26 19:29:20,677 INFO L226 Difference]: Without dead ends: 100001 [2018-10-26 19:29:20,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 827 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2018-10-26 19:29:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100001 states. [2018-10-26 19:29:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100001 to 54446. [2018-10-26 19:29:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54446 states. [2018-10-26 19:29:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54446 states to 54446 states and 56500 transitions. [2018-10-26 19:29:21,432 INFO L78 Accepts]: Start accepts. Automaton has 54446 states and 56500 transitions. Word has length 813 [2018-10-26 19:29:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:29:21,432 INFO L481 AbstractCegarLoop]: Abstraction has 54446 states and 56500 transitions. [2018-10-26 19:29:21,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 19:29:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 54446 states and 56500 transitions. [2018-10-26 19:29:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2018-10-26 19:29:21,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:29:21,444 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:29:21,444 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:29:21,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:29:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1023008564, now seen corresponding path program 1 times [2018-10-26 19:29:21,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:29:21,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:29:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:21,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:21,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2018-10-26 19:29:22,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:29:22,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:29:22,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:29:22,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:29:22,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:29:22,552 INFO L87 Difference]: Start difference. First operand 54446 states and 56500 transitions. Second operand 5 states. [2018-10-26 19:29:26,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:29:26,358 INFO L93 Difference]: Finished difference Result 117948 states and 122402 transitions. [2018-10-26 19:29:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:29:26,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 863 [2018-10-26 19:29:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:29:26,422 INFO L225 Difference]: With dead ends: 117948 [2018-10-26 19:29:26,423 INFO L226 Difference]: Without dead ends: 63783 [2018-10-26 19:29:26,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:29:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63783 states. [2018-10-26 19:29:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63783 to 59047. [2018-10-26 19:29:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59047 states. [2018-10-26 19:29:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59047 states to 59047 states and 61188 transitions. [2018-10-26 19:29:27,036 INFO L78 Accepts]: Start accepts. Automaton has 59047 states and 61188 transitions. Word has length 863 [2018-10-26 19:29:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:29:27,037 INFO L481 AbstractCegarLoop]: Abstraction has 59047 states and 61188 transitions. [2018-10-26 19:29:27,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:29:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 59047 states and 61188 transitions. [2018-10-26 19:29:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2018-10-26 19:29:27,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:29:27,052 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:29:27,052 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:29:27,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:29:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2113205302, now seen corresponding path program 1 times [2018-10-26 19:29:27,053 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:29:27,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:29:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:27,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 587 proven. 385 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-26 19:29:29,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:29:29,135 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:29:29,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:29,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:29:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 972 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-26 19:29:31,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:29:31,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2018-10-26 19:29:31,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 19:29:31,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 19:29:31,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:29:31,520 INFO L87 Difference]: Start difference. First operand 59047 states and 61188 transitions. Second operand 12 states. [2018-10-26 19:29:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:29:38,711 INFO L93 Difference]: Finished difference Result 118118 states and 122403 transitions. [2018-10-26 19:29:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 19:29:38,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 937 [2018-10-26 19:29:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:29:38,765 INFO L225 Difference]: With dead ends: 118118 [2018-10-26 19:29:38,766 INFO L226 Difference]: Without dead ends: 59403 [2018-10-26 19:29:38,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 934 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-10-26 19:29:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59403 states. [2018-10-26 19:29:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59403 to 57397. [2018-10-26 19:29:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57397 states. [2018-10-26 19:29:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57397 states to 57397 states and 59364 transitions. [2018-10-26 19:29:39,419 INFO L78 Accepts]: Start accepts. Automaton has 57397 states and 59364 transitions. Word has length 937 [2018-10-26 19:29:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:29:39,420 INFO L481 AbstractCegarLoop]: Abstraction has 57397 states and 59364 transitions. [2018-10-26 19:29:39,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 19:29:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 57397 states and 59364 transitions. [2018-10-26 19:29:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2018-10-26 19:29:39,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:29:39,446 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:29:39,446 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:29:39,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:29:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 707725682, now seen corresponding path program 1 times [2018-10-26 19:29:39,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:29:39,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:29:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:39,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:40,091 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 19:29:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 100 proven. 300 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2018-10-26 19:29:41,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:29:41,028 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:29:41,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:41,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:29:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-26 19:29:42,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:29:42,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-10-26 19:29:42,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 19:29:42,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 19:29:42,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:29:42,016 INFO L87 Difference]: Start difference. First operand 57397 states and 59364 transitions. Second operand 8 states. [2018-10-26 19:29:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:29:46,249 INFO L93 Difference]: Finished difference Result 106515 states and 110207 transitions. [2018-10-26 19:29:46,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:29:46,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1046 [2018-10-26 19:29:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:29:46,301 INFO L225 Difference]: With dead ends: 106515 [2018-10-26 19:29:46,301 INFO L226 Difference]: Without dead ends: 49450 [2018-10-26 19:29:46,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 1047 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:29:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49450 states. [2018-10-26 19:29:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49450 to 46434. [2018-10-26 19:29:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46434 states. [2018-10-26 19:29:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46434 states to 46434 states and 47627 transitions. [2018-10-26 19:29:46,812 INFO L78 Accepts]: Start accepts. Automaton has 46434 states and 47627 transitions. Word has length 1046 [2018-10-26 19:29:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:29:46,813 INFO L481 AbstractCegarLoop]: Abstraction has 46434 states and 47627 transitions. [2018-10-26 19:29:46,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 19:29:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 46434 states and 47627 transitions. [2018-10-26 19:29:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-10-26 19:29:46,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:29:46,831 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:29:46,831 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:29:46,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:29:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash -855400853, now seen corresponding path program 1 times [2018-10-26 19:29:46,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:29:46,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:29:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:46,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:46,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2065 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 1388 trivial. 0 not checked. [2018-10-26 19:29:48,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:29:48,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:29:48,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:29:48,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:29:48,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:29:48,178 INFO L87 Difference]: Start difference. First operand 46434 states and 47627 transitions. Second operand 4 states. [2018-10-26 19:29:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:29:50,652 INFO L93 Difference]: Finished difference Result 94548 states and 97002 transitions. [2018-10-26 19:29:50,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:29:50,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1103 [2018-10-26 19:29:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:29:50,705 INFO L225 Difference]: With dead ends: 94548 [2018-10-26 19:29:50,706 INFO L226 Difference]: Without dead ends: 48446 [2018-10-26 19:29:50,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:29:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48446 states. [2018-10-26 19:29:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48446 to 46102. [2018-10-26 19:29:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46102 states. [2018-10-26 19:29:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46102 states to 46102 states and 47297 transitions. [2018-10-26 19:29:51,228 INFO L78 Accepts]: Start accepts. Automaton has 46102 states and 47297 transitions. Word has length 1103 [2018-10-26 19:29:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:29:51,229 INFO L481 AbstractCegarLoop]: Abstraction has 46102 states and 47297 transitions. [2018-10-26 19:29:51,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:29:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 46102 states and 47297 transitions. [2018-10-26 19:29:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1178 [2018-10-26 19:29:51,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:29:51,253 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:29:51,253 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:29:51,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:29:51,254 INFO L82 PathProgramCache]: Analyzing trace with hash 597050211, now seen corresponding path program 1 times [2018-10-26 19:29:51,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:29:51,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:29:51,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:51,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:51,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:29:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 744 proven. 25 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-26 19:29:53,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:29:53,277 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:29:53,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:29:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:29:53,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:29:53,778 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2018-10-26 19:29:58,066 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 185 DAG size of output: 26 [2018-10-26 19:29:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 744 proven. 25 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-26 19:29:59,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:29:59,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-10-26 19:29:59,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:29:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:29:59,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2018-10-26 19:29:59,432 INFO L87 Difference]: Start difference. First operand 46102 states and 47297 transitions. Second operand 7 states. Received shutdown request... [2018-10-26 19:30:03,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:30:03,433 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 19:30:03,438 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 19:30:03,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:30:03 BoogieIcfgContainer [2018-10-26 19:30:03,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:30:03,439 INFO L168 Benchmark]: Toolchain (without parser) took 234174.53 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-26 19:30:03,441 INFO L168 Benchmark]: CDTParser took 0.22 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-26 19:30:03,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1243.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-26 19:30:03,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 360.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -847.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-26 19:30:03,443 INFO L168 Benchmark]: Boogie Preprocessor took 194.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:30:03,443 INFO L168 Benchmark]: RCFGBuilder took 6240.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 271.6 MB). Peak memory consumption was 271.6 MB. Max. memory is 7.1 GB. [2018-10-26 19:30:03,444 INFO L168 Benchmark]: TraceAbstraction took 226130.97 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -555.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-26 19:30:03,449 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1243.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 360.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -847.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 194.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6240.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 271.6 MB). Peak memory consumption was 271.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 226130.97 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -555.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (46102states) and FLOYD_HOARE automaton (currently 4 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (5975 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 397 locations, 1 error locations. TIMEOUT Result, 226.0s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 165.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4136 SDtfs, 28937 SDslu, 4268 SDs, 0 SdLazy, 75767 SolverSat, 8168 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 109.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8040 GetRequests, 7888 SyntacticMatches, 14 SemanticMatches, 138 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 50.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59047occurred in iteration=17, 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: 7.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 91927 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 38.3s InterpolantComputationTime, 20409 NumberOfCodeBlocks, 20409 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 20378 ConstructedInterpolants, 339 QuantifiedInterpolants, 95710840 SizeOfPredicates, 10 NumberOfNonLiveVariables, 9083 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 22426/24873 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown