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/Problem15_label32_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 20:32:24,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 20:32:24,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 20:32:24,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 20:32:24,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 20:32:24,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 20:32:24,909 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 20:32:24,912 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 20:32:24,915 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 20:32:24,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 20:32:24,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 20:32:24,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 20:32:24,921 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 20:32:24,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 20:32:24,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 20:32:24,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 20:32:24,936 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 20:32:24,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 20:32:24,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 20:32:24,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 20:32:24,944 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 20:32:24,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 20:32:24,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 20:32:24,953 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 20:32:24,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 20:32:24,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 20:32:24,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 20:32:24,958 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 20:32:24,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 20:32:24,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 20:32:24,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 20:32:24,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 20:32:24,962 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 20:32:24,962 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 20:32:24,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 20:32:24,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 20:32:24,965 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-23 20:32:24,981 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 20:32:24,981 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 20:32:24,982 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 20:32:24,982 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 20:32:24,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 20:32:24,983 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 20:32:24,983 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 20:32:24,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 20:32:24,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 20:32:24,984 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 20:32:24,984 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 20:32:24,984 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 20:32:24,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 20:32:24,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 20:32:24,985 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 20:32:24,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 20:32:24,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 20:32:24,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 20:32:24,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 20:32:24,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:32:24,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 20:32:24,987 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 20:32:24,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 20:32:24,987 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 20:32:24,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 20:32:24,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 20:32:24,988 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 20:32:24,988 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 20:32:25,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 20:32:25,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 20:32:25,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 20:32:25,063 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 20:32:25,063 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 20:32:25,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label32_true-unreach-call.c [2018-10-23 20:32:25,130 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84931d7d6/b05df79dfa694b65a6c7b6a57aaaf3c6/FLAGbef0d3dc3 [2018-10-23 20:32:25,839 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 20:32:25,840 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label32_true-unreach-call.c [2018-10-23 20:32:25,858 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84931d7d6/b05df79dfa694b65a6c7b6a57aaaf3c6/FLAGbef0d3dc3 [2018-10-23 20:32:25,874 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84931d7d6/b05df79dfa694b65a6c7b6a57aaaf3c6 [2018-10-23 20:32:25,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 20:32:25,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 20:32:25,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 20:32:25,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 20:32:25,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 20:32:25,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:32:25" (1/1) ... [2018-10-23 20:32:25,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a993caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:25, skipping insertion in model container [2018-10-23 20:32:25,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:32:25" (1/1) ... [2018-10-23 20:32:25,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 20:32:25,989 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 20:32:26,784 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:32:26,789 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 20:32:27,054 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:32:27,074 INFO L193 MainTranslator]: Completed translation [2018-10-23 20:32:27,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27 WrapperNode [2018-10-23 20:32:27,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 20:32:27,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 20:32:27,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 20:32:27,076 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 20:32:27,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (1/1) ... [2018-10-23 20:32:27,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (1/1) ... [2018-10-23 20:32:27,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 20:32:27,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 20:32:27,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 20:32:27,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 20:32:27,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (1/1) ... [2018-10-23 20:32:27,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (1/1) ... [2018-10-23 20:32:27,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (1/1) ... [2018-10-23 20:32:27,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (1/1) ... [2018-10-23 20:32:27,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (1/1) ... [2018-10-23 20:32:27,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (1/1) ... [2018-10-23 20:32:27,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (1/1) ... [2018-10-23 20:32:27,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 20:32:27,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 20:32:27,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 20:32:27,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 20:32:27,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (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-23 20:32:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 20:32:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 20:32:27,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 20:32:36,181 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 20:32:36,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:32:36 BoogieIcfgContainer [2018-10-23 20:32:36,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 20:32:36,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 20:32:36,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 20:32:36,186 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 20:32:36,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:32:25" (1/3) ... [2018-10-23 20:32:36,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f90730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:32:36, skipping insertion in model container [2018-10-23 20:32:36,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:32:27" (2/3) ... [2018-10-23 20:32:36,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f90730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:32:36, skipping insertion in model container [2018-10-23 20:32:36,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:32:36" (3/3) ... [2018-10-23 20:32:36,190 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label32_true-unreach-call.c [2018-10-23 20:32:36,200 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 20:32:36,209 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 20:32:36,227 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 20:32:36,265 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 20:32:36,266 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 20:32:36,266 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 20:32:36,266 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 20:32:36,266 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 20:32:36,266 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 20:32:36,267 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 20:32:36,267 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 20:32:36,267 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 20:32:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-10-23 20:32:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-23 20:32:36,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:32:36,304 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:32:36,306 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:32:36,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:32:36,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1705034714, now seen corresponding path program 1 times [2018-10-23 20:32:36,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:32:36,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:32:36,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:32:36,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:32:36,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:32:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:32:36,759 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-23 20:32:36,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:32:36,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:32:36,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:32:36,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:32:36,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:32:36,790 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-10-23 20:32:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:32:44,846 INFO L93 Difference]: Finished difference Result 1470 states and 2718 transitions. [2018-10-23 20:32:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:32:44,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-10-23 20:32:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:32:44,876 INFO L225 Difference]: With dead ends: 1470 [2018-10-23 20:32:44,877 INFO L226 Difference]: Without dead ends: 1038 [2018-10-23 20:32:44,883 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-23 20:32:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-10-23 20:32:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1036. [2018-10-23 20:32:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-10-23 20:32:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1670 transitions. [2018-10-23 20:32:44,993 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1670 transitions. Word has length 50 [2018-10-23 20:32:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:32:44,994 INFO L481 AbstractCegarLoop]: Abstraction has 1036 states and 1670 transitions. [2018-10-23 20:32:44,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:32:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1670 transitions. [2018-10-23 20:32:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-23 20:32:45,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:32:45,009 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:32:45,009 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:32:45,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:32:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1442462389, now seen corresponding path program 1 times [2018-10-23 20:32:45,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:32:45,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:32:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:32:45,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:32:45,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:32:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:32:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:32:45,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:32:45,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:32:45,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:32:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:32:45,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:32:45,352 INFO L87 Difference]: Start difference. First operand 1036 states and 1670 transitions. Second operand 4 states. [2018-10-23 20:32:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:32:52,854 INFO L93 Difference]: Finished difference Result 3937 states and 6425 transitions. [2018-10-23 20:32:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:32:52,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-10-23 20:32:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:32:52,878 INFO L225 Difference]: With dead ends: 3937 [2018-10-23 20:32:52,878 INFO L226 Difference]: Without dead ends: 2903 [2018-10-23 20:32:52,884 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-23 20:32:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2018-10-23 20:32:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1937. [2018-10-23 20:32:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2018-10-23 20:32:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2808 transitions. [2018-10-23 20:32:52,970 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2808 transitions. Word has length 163 [2018-10-23 20:32:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:32:52,971 INFO L481 AbstractCegarLoop]: Abstraction has 1937 states and 2808 transitions. [2018-10-23 20:32:52,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:32:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2808 transitions. [2018-10-23 20:32:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-23 20:32:52,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:32:52,987 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:32:52,988 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:32:52,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:32:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash -504112379, now seen corresponding path program 1 times [2018-10-23 20:32:52,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:32:52,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:32:52,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:32:52,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:32:52,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:32:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:32:53,646 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-23 20:32:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-23 20:32:53,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:32:53,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:32:53,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:32:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:32:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:32:53,919 INFO L87 Difference]: Start difference. First operand 1937 states and 2808 transitions. Second operand 5 states. [2018-10-23 20:33:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:33:02,616 INFO L93 Difference]: Finished difference Result 4777 states and 6638 transitions. [2018-10-23 20:33:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:33:02,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 324 [2018-10-23 20:33:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:33:02,635 INFO L225 Difference]: With dead ends: 4777 [2018-10-23 20:33:02,635 INFO L226 Difference]: Without dead ends: 2842 [2018-10-23 20:33:02,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:33:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-10-23 20:33:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2841. [2018-10-23 20:33:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2841 states. [2018-10-23 20:33:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 3775 transitions. [2018-10-23 20:33:02,697 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 3775 transitions. Word has length 324 [2018-10-23 20:33:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:33:02,698 INFO L481 AbstractCegarLoop]: Abstraction has 2841 states and 3775 transitions. [2018-10-23 20:33:02,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:33:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3775 transitions. [2018-10-23 20:33:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-23 20:33:02,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:33:02,706 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:33:02,706 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:33:02,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:33:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash -606678765, now seen corresponding path program 1 times [2018-10-23 20:33:02,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:33:02,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:33:02,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:02,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:33:03,413 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-23 20:33:03,955 WARN L179 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-23 20:33:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 88 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:33:04,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:33:04,681 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-23 20:33:04,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:33:04,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:33:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:33:05,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:33:05,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2018-10-23 20:33:05,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 20:33:05,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 20:33:05,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-23 20:33:05,185 INFO L87 Difference]: Start difference. First operand 2841 states and 3775 transitions. Second operand 11 states. [2018-10-23 20:33:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:33:27,970 INFO L93 Difference]: Finished difference Result 10306 states and 14223 transitions. [2018-10-23 20:33:27,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-23 20:33:27,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 398 [2018-10-23 20:33:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:33:28,011 INFO L225 Difference]: With dead ends: 10306 [2018-10-23 20:33:28,011 INFO L226 Difference]: Without dead ends: 7467 [2018-10-23 20:33:28,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 409 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-10-23 20:33:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2018-10-23 20:33:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7085. [2018-10-23 20:33:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2018-10-23 20:33:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 9169 transitions. [2018-10-23 20:33:28,167 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 9169 transitions. Word has length 398 [2018-10-23 20:33:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:33:28,168 INFO L481 AbstractCegarLoop]: Abstraction has 7085 states and 9169 transitions. [2018-10-23 20:33:28,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 20:33:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 9169 transitions. [2018-10-23 20:33:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-10-23 20:33:28,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:33:28,185 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:33:28,186 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:33:28,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:33:28,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1942363427, now seen corresponding path program 1 times [2018-10-23 20:33:28,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:33:28,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:33:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:28,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:33:28,841 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-23 20:33:29,423 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-23 20:33:30,146 WARN L179 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-10-23 20:33:30,760 WARN L179 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2018-10-23 20:33:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 301 proven. 136 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-23 20:33:31,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:33:31,354 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-23 20:33:31,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:33:31,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:33:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-23 20:33:31,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:33:31,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-10-23 20:33:31,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:33:31,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:33:31,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-23 20:33:31,938 INFO L87 Difference]: Start difference. First operand 7085 states and 9169 transitions. Second operand 9 states. [2018-10-23 20:33:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:33:43,957 INFO L93 Difference]: Finished difference Result 14846 states and 19047 transitions. [2018-10-23 20:33:43,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 20:33:43,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 550 [2018-10-23 20:33:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:33:43,985 INFO L225 Difference]: With dead ends: 14846 [2018-10-23 20:33:43,985 INFO L226 Difference]: Without dead ends: 7763 [2018-10-23 20:33:43,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 554 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-23 20:33:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7763 states. [2018-10-23 20:33:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7763 to 7082. [2018-10-23 20:33:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2018-10-23 20:33:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8415 transitions. [2018-10-23 20:33:44,161 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8415 transitions. Word has length 550 [2018-10-23 20:33:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:33:44,162 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8415 transitions. [2018-10-23 20:33:44,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:33:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8415 transitions. [2018-10-23 20:33:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2018-10-23 20:33:44,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:33:44,184 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:33:44,184 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:33:44,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:33:44,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1855742868, now seen corresponding path program 1 times [2018-10-23 20:33:44,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:33:44,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:33:44,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:44,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:44,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:33:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-23 20:33:44,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:33:44,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:33:44,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:33:44,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:33:44,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:33:44,952 INFO L87 Difference]: Start difference. First operand 7082 states and 8415 transitions. Second operand 3 states. [2018-10-23 20:33:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:33:48,515 INFO L93 Difference]: Finished difference Result 18397 states and 21875 transitions. [2018-10-23 20:33:48,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:33:48,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 580 [2018-10-23 20:33:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:33:48,554 INFO L225 Difference]: With dead ends: 18397 [2018-10-23 20:33:48,554 INFO L226 Difference]: Without dead ends: 11317 [2018-10-23 20:33:48,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:33:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11317 states. [2018-10-23 20:33:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11317 to 11317. [2018-10-23 20:33:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2018-10-23 20:33:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 13210 transitions. [2018-10-23 20:33:48,759 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 13210 transitions. Word has length 580 [2018-10-23 20:33:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:33:48,760 INFO L481 AbstractCegarLoop]: Abstraction has 11317 states and 13210 transitions. [2018-10-23 20:33:48,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:33:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 13210 transitions. [2018-10-23 20:33:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2018-10-23 20:33:48,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:33:48,786 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:33:48,786 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:33:48,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:33:48,787 INFO L82 PathProgramCache]: Analyzing trace with hash -594189588, now seen corresponding path program 1 times [2018-10-23 20:33:48,787 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:33:48,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:33:48,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:48,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:48,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:33:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 730 proven. 4 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2018-10-23 20:33:50,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:33:50,153 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-23 20:33:50,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:33:50,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:33:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-10-23 20:33:50,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:33:50,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-23 20:33:50,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 20:33:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 20:33:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:33:50,658 INFO L87 Difference]: Start difference. First operand 11317 states and 13210 transitions. Second operand 8 states. [2018-10-23 20:34:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:01,072 INFO L93 Difference]: Finished difference Result 31201 states and 35896 transitions. [2018-10-23 20:34:01,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-23 20:34:01,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 634 [2018-10-23 20:34:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:01,101 INFO L225 Difference]: With dead ends: 31201 [2018-10-23 20:34:01,101 INFO L226 Difference]: Without dead ends: 15212 [2018-10-23 20:34:01,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 645 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-10-23 20:34:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15212 states. [2018-10-23 20:34:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15212 to 14912. [2018-10-23 20:34:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14912 states. [2018-10-23 20:34:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14912 states to 14912 states and 16603 transitions. [2018-10-23 20:34:01,339 INFO L78 Accepts]: Start accepts. Automaton has 14912 states and 16603 transitions. Word has length 634 [2018-10-23 20:34:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:01,340 INFO L481 AbstractCegarLoop]: Abstraction has 14912 states and 16603 transitions. [2018-10-23 20:34:01,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 20:34:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 14912 states and 16603 transitions. [2018-10-23 20:34:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-10-23 20:34:01,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:01,369 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 20:34:01,369 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:01,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:01,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1497719346, now seen corresponding path program 1 times [2018-10-23 20:34:01,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:01,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:01,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:01,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-10-23 20:34:02,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:34:02,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:34:02,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:34:02,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:34:02,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:34:02,491 INFO L87 Difference]: Start difference. First operand 14912 states and 16603 transitions. Second operand 5 states. [2018-10-23 20:34:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:08,065 INFO L93 Difference]: Finished difference Result 32765 states and 36344 transitions. [2018-10-23 20:34:08,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:34:08,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 675 [2018-10-23 20:34:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:08,084 INFO L225 Difference]: With dead ends: 32765 [2018-10-23 20:34:08,085 INFO L226 Difference]: Without dead ends: 9385 [2018-10-23 20:34:08,103 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-23 20:34:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9385 states. [2018-10-23 20:34:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9385 to 6040. [2018-10-23 20:34:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6040 states. [2018-10-23 20:34:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6040 states to 6040 states and 6235 transitions. [2018-10-23 20:34:08,200 INFO L78 Accepts]: Start accepts. Automaton has 6040 states and 6235 transitions. Word has length 675 [2018-10-23 20:34:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:08,201 INFO L481 AbstractCegarLoop]: Abstraction has 6040 states and 6235 transitions. [2018-10-23 20:34:08,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:34:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 6040 states and 6235 transitions. [2018-10-23 20:34:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-10-23 20:34:08,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:08,213 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:34:08,213 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:08,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:08,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1251493293, now seen corresponding path program 1 times [2018-10-23 20:34:08,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:08,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:08,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 48 proven. 525 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-23 20:34:09,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:34:09,998 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-23 20:34:10,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:10,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:34:11,745 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (and (<= (mod v_prenex_1 299926) (+ c_~a0~0 300072)) (<= (+ v_prenex_1 44) 0) (<= 0 v_prenex_1))) (exists ((v_~a0~0_825 Int)) (let ((.cse0 (mod v_~a0~0_825 299926))) (and (<= (+ v_~a0~0_825 44) 0) (<= .cse0 (+ c_~a0~0 300072)) (= .cse0 0)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (<= .cse1 (+ c_~a0~0 599998)) (not (= .cse1 0)))))) is different from true [2018-10-23 20:34:14,466 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 164 DAG size of output: 23 [2018-10-23 20:34:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 350 trivial. 430 not checked. [2018-10-23 20:34:16,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:34:16,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-23 20:34:16,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:34:16,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:34:16,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2018-10-23 20:34:16,409 INFO L87 Difference]: Start difference. First operand 6040 states and 6235 transitions. Second operand 9 states. [2018-10-23 20:34:29,476 WARN L179 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2018-10-23 20:34:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:29,841 INFO L93 Difference]: Finished difference Result 14322 states and 14794 transitions. [2018-10-23 20:34:29,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-23 20:34:29,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 745 [2018-10-23 20:34:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:29,864 INFO L225 Difference]: With dead ends: 14322 [2018-10-23 20:34:29,864 INFO L226 Difference]: Without dead ends: 14320 [2018-10-23 20:34:29,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 742 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=42, Invalid=70, Unknown=2, NotChecked=18, Total=132 [2018-10-23 20:34:29,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14320 states. [2018-10-23 20:34:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14320 to 11911. [2018-10-23 20:34:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11911 states. [2018-10-23 20:34:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11911 states to 11911 states and 12303 transitions. [2018-10-23 20:34:30,037 INFO L78 Accepts]: Start accepts. Automaton has 11911 states and 12303 transitions. Word has length 745 [2018-10-23 20:34:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:30,038 INFO L481 AbstractCegarLoop]: Abstraction has 11911 states and 12303 transitions. [2018-10-23 20:34:30,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:34:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 11911 states and 12303 transitions. [2018-10-23 20:34:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2018-10-23 20:34:30,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:30,053 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:34:30,054 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:30,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash 917863768, now seen corresponding path program 1 times [2018-10-23 20:34:30,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:30,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:30,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:30,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:30,602 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2018-10-23 20:34:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-23 20:34:31,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:34:31,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:34:31,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:34:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:34:31,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:34:31,119 INFO L87 Difference]: Start difference. First operand 11911 states and 12303 transitions. Second operand 3 states. [2018-10-23 20:34:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:32,547 INFO L93 Difference]: Finished difference Result 30725 states and 31745 transitions. [2018-10-23 20:34:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:34:32,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 803 [2018-10-23 20:34:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:32,572 INFO L225 Difference]: With dead ends: 30725 [2018-10-23 20:34:32,572 INFO L226 Difference]: Without dead ends: 19116 [2018-10-23 20:34:32,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:34:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19116 states. [2018-10-23 20:34:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19116 to 17607. [2018-10-23 20:34:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17607 states. [2018-10-23 20:34:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17607 states to 17607 states and 18123 transitions. [2018-10-23 20:34:32,831 INFO L78 Accepts]: Start accepts. Automaton has 17607 states and 18123 transitions. Word has length 803 [2018-10-23 20:34:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:32,832 INFO L481 AbstractCegarLoop]: Abstraction has 17607 states and 18123 transitions. [2018-10-23 20:34:32,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:34:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 17607 states and 18123 transitions. [2018-10-23 20:34:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2018-10-23 20:34:32,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:32,861 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:34:32,862 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:32,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:32,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1325868944, now seen corresponding path program 1 times [2018-10-23 20:34:32,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:32,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:32,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:32,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:32,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:33,558 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 20:34:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 888 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-10-23 20:34:34,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:34:34,056 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-23 20:34:34,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:34,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:34:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 976 proven. 77 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-10-23 20:34:35,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:34:35,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-10-23 20:34:35,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:34:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:34:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-23 20:34:35,235 INFO L87 Difference]: Start difference. First operand 17607 states and 18123 transitions. Second operand 9 states. [2018-10-23 20:34:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:42,234 INFO L93 Difference]: Finished difference Result 40027 states and 41228 transitions. [2018-10-23 20:34:42,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-23 20:34:42,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 824 [2018-10-23 20:34:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:42,257 INFO L225 Difference]: With dead ends: 40027 [2018-10-23 20:34:42,257 INFO L226 Difference]: Without dead ends: 22722 [2018-10-23 20:34:42,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 827 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-10-23 20:34:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22722 states. [2018-10-23 20:34:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22722 to 18806. [2018-10-23 20:34:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18806 states. [2018-10-23 20:34:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18806 states to 18806 states and 19284 transitions. [2018-10-23 20:34:42,554 INFO L78 Accepts]: Start accepts. Automaton has 18806 states and 19284 transitions. Word has length 824 [2018-10-23 20:34:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:42,555 INFO L481 AbstractCegarLoop]: Abstraction has 18806 states and 19284 transitions. [2018-10-23 20:34:42,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:34:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18806 states and 19284 transitions. [2018-10-23 20:34:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-10-23 20:34:42,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:42,584 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:34:42,585 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:42,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:42,587 INFO L82 PathProgramCache]: Analyzing trace with hash -855129057, now seen corresponding path program 1 times [2018-10-23 20:34:42,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:42,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:42,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:42,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2018-10-23 20:34:43,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:34:43,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:34:43,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:34:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:34:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:34:43,711 INFO L87 Difference]: Start difference. First operand 18806 states and 19284 transitions. Second operand 3 states. [2018-10-23 20:34:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:46,066 INFO L93 Difference]: Finished difference Result 32949 states and 33809 transitions. [2018-10-23 20:34:46,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:34:46,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 830 [2018-10-23 20:34:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:46,084 INFO L225 Difference]: With dead ends: 32949 [2018-10-23 20:34:46,084 INFO L226 Difference]: Without dead ends: 18502 [2018-10-23 20:34:46,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:34:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18502 states. [2018-10-23 20:34:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18502 to 17602. [2018-10-23 20:34:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17602 states. [2018-10-23 20:34:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17602 states to 17602 states and 17959 transitions. [2018-10-23 20:34:46,308 INFO L78 Accepts]: Start accepts. Automaton has 17602 states and 17959 transitions. Word has length 830 [2018-10-23 20:34:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:46,309 INFO L481 AbstractCegarLoop]: Abstraction has 17602 states and 17959 transitions. [2018-10-23 20:34:46,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:34:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 17602 states and 17959 transitions. [2018-10-23 20:34:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2018-10-23 20:34:46,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:46,326 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:34:46,326 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:46,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:46,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1881357704, now seen corresponding path program 1 times [2018-10-23 20:34:46,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:46,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:46,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:46,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:46,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-23 20:34:47,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:34:47,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:34:47,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:34:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:34:47,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:34:47,229 INFO L87 Difference]: Start difference. First operand 17602 states and 17959 transitions. Second operand 4 states. [2018-10-23 20:34:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:50,991 INFO L93 Difference]: Finished difference Result 35507 states and 36242 transitions. [2018-10-23 20:34:50,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:34:50,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 834 [2018-10-23 20:34:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:51,012 INFO L225 Difference]: With dead ends: 35507 [2018-10-23 20:34:51,012 INFO L226 Difference]: Without dead ends: 18207 [2018-10-23 20:34:51,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:34:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18207 states. [2018-10-23 20:34:51,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18207 to 17902. [2018-10-23 20:34:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17902 states. [2018-10-23 20:34:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17902 states to 17902 states and 18226 transitions. [2018-10-23 20:34:51,204 INFO L78 Accepts]: Start accepts. Automaton has 17902 states and 18226 transitions. Word has length 834 [2018-10-23 20:34:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:51,205 INFO L481 AbstractCegarLoop]: Abstraction has 17902 states and 18226 transitions. [2018-10-23 20:34:51,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:34:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 17902 states and 18226 transitions. [2018-10-23 20:34:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2018-10-23 20:34:51,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:51,221 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, 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, 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, 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] [2018-10-23 20:34:51,221 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:51,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1278165660, now seen corresponding path program 1 times [2018-10-23 20:34:51,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:51,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-23 20:34:52,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:34:52,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:34:52,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:34:52,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:34:52,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:34:52,867 INFO L87 Difference]: Start difference. First operand 17902 states and 18226 transitions. Second operand 5 states. [2018-10-23 20:34:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:56,003 INFO L93 Difference]: Finished difference Result 24819 states and 25276 transitions. [2018-10-23 20:34:56,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:34:56,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 836 [2018-10-23 20:34:56,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:56,026 INFO L225 Difference]: With dead ends: 24819 [2018-10-23 20:34:56,026 INFO L226 Difference]: Without dead ends: 24817 [2018-10-23 20:34:56,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:34:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24817 states. [2018-10-23 20:34:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24817 to 11139. [2018-10-23 20:34:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11139 states. [2018-10-23 20:34:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11139 states to 11139 states and 11328 transitions. [2018-10-23 20:34:56,195 INFO L78 Accepts]: Start accepts. Automaton has 11139 states and 11328 transitions. Word has length 836 [2018-10-23 20:34:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:56,196 INFO L481 AbstractCegarLoop]: Abstraction has 11139 states and 11328 transitions. [2018-10-23 20:34:56,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:34:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 11139 states and 11328 transitions. [2018-10-23 20:34:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2018-10-23 20:34:56,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:56,215 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 20:34:56,216 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:56,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:56,216 INFO L82 PathProgramCache]: Analyzing trace with hash 680449423, now seen corresponding path program 1 times [2018-10-23 20:34:56,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:56,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:56,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 96 proven. 849 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2018-10-23 20:34:58,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:34:58,731 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-23 20:34:58,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:59,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:35:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 585 proven. 445 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2018-10-23 20:35:00,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:35:00,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-23 20:35:00,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 20:35:00,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 20:35:00,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:35:00,685 INFO L87 Difference]: Start difference. First operand 11139 states and 11328 transitions. Second operand 8 states. [2018-10-23 20:35:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:05,951 INFO L93 Difference]: Finished difference Result 30092 states and 30631 transitions. [2018-10-23 20:35:05,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 20:35:05,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1048 [2018-10-23 20:35:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:05,972 INFO L225 Difference]: With dead ends: 30092 [2018-10-23 20:35:05,973 INFO L226 Difference]: Without dead ends: 19255 [2018-10-23 20:35:05,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 1044 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-23 20:35:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19255 states. [2018-10-23 20:35:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19255 to 12641. [2018-10-23 20:35:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12641 states. [2018-10-23 20:35:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12641 states to 12641 states and 12866 transitions. [2018-10-23 20:35:06,162 INFO L78 Accepts]: Start accepts. Automaton has 12641 states and 12866 transitions. Word has length 1048 [2018-10-23 20:35:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:06,162 INFO L481 AbstractCegarLoop]: Abstraction has 12641 states and 12866 transitions. [2018-10-23 20:35:06,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 20:35:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 12641 states and 12866 transitions. [2018-10-23 20:35:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1089 [2018-10-23 20:35:06,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:35:06,176 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:35:06,177 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:35:06,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:35:06,177 INFO L82 PathProgramCache]: Analyzing trace with hash -579580417, now seen corresponding path program 1 times [2018-10-23 20:35:06,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:35:06,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:35:06,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:06,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:06,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:06,764 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-10-23 20:35:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 1334 proven. 0 refuted. 0 times theorem prover too weak. 881 trivial. 0 not checked. [2018-10-23 20:35:07,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:35:07,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:35:07,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:35:07,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:35:07,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:35:07,459 INFO L87 Difference]: Start difference. First operand 12641 states and 12866 transitions. Second operand 3 states. [2018-10-23 20:35:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:08,845 INFO L93 Difference]: Finished difference Result 26787 states and 27266 transitions. [2018-10-23 20:35:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:35:08,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1088 [2018-10-23 20:35:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:08,859 INFO L225 Difference]: With dead ends: 26787 [2018-10-23 20:35:08,859 INFO L226 Difference]: Without dead ends: 14448 [2018-10-23 20:35:08,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:35:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14448 states. [2018-10-23 20:35:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14448 to 12338. [2018-10-23 20:35:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12338 states. [2018-10-23 20:35:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12338 states to 12338 states and 12538 transitions. [2018-10-23 20:35:09,000 INFO L78 Accepts]: Start accepts. Automaton has 12338 states and 12538 transitions. Word has length 1088 [2018-10-23 20:35:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:09,001 INFO L481 AbstractCegarLoop]: Abstraction has 12338 states and 12538 transitions. [2018-10-23 20:35:09,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:35:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 12338 states and 12538 transitions. [2018-10-23 20:35:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1174 [2018-10-23 20:35:09,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:35:09,017 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:35:09,017 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:35:09,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:35:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash -814989459, now seen corresponding path program 1 times [2018-10-23 20:35:09,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:35:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:35:09,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:09,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:09,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:09,916 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-23 20:35:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 1687 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2018-10-23 20:35:11,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:35:11,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:35:11,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:35:11,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:35:11,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:35:11,106 INFO L87 Difference]: Start difference. First operand 12338 states and 12538 transitions. Second operand 5 states. [2018-10-23 20:35:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:13,728 INFO L93 Difference]: Finished difference Result 26783 states and 27227 transitions. [2018-10-23 20:35:13,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 20:35:13,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1173 [2018-10-23 20:35:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:13,742 INFO L225 Difference]: With dead ends: 26783 [2018-10-23 20:35:13,742 INFO L226 Difference]: Without dead ends: 14747 [2018-10-23 20:35:13,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:35:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14747 states. [2018-10-23 20:35:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14747 to 13238. [2018-10-23 20:35:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13238 states. [2018-10-23 20:35:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13238 states to 13238 states and 13444 transitions. [2018-10-23 20:35:13,902 INFO L78 Accepts]: Start accepts. Automaton has 13238 states and 13444 transitions. Word has length 1173 [2018-10-23 20:35:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:13,903 INFO L481 AbstractCegarLoop]: Abstraction has 13238 states and 13444 transitions. [2018-10-23 20:35:13,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:35:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 13238 states and 13444 transitions. [2018-10-23 20:35:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1176 [2018-10-23 20:35:13,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:35:13,923 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, 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, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:35:13,923 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:35:13,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:35:13,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1364753664, now seen corresponding path program 1 times [2018-10-23 20:35:13,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:35:13,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:35:13,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:13,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:13,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 794 proven. 632 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2018-10-23 20:35:16,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:35:16,650 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-23 20:35:16,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:16,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:35:17,485 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 14 [2018-10-23 20:35:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 842 proven. 0 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2018-10-23 20:35:18,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:35:18,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-10-23 20:35:18,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 20:35:18,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 20:35:18,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:35:18,416 INFO L87 Difference]: Start difference. First operand 13238 states and 13444 transitions. Second operand 7 states. [2018-10-23 20:35:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:24,507 INFO L93 Difference]: Finished difference Result 35804 states and 36356 transitions. [2018-10-23 20:35:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 20:35:24,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1175 [2018-10-23 20:35:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:24,527 INFO L225 Difference]: With dead ends: 35804 [2018-10-23 20:35:24,527 INFO L226 Difference]: Without dead ends: 22868 [2018-10-23 20:35:24,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 1174 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:35:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22868 states. [2018-10-23 20:35:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22868 to 12939. [2018-10-23 20:35:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12939 states. [2018-10-23 20:35:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12939 states to 12939 states and 13131 transitions. [2018-10-23 20:35:24,715 INFO L78 Accepts]: Start accepts. Automaton has 12939 states and 13131 transitions. Word has length 1175 [2018-10-23 20:35:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:24,716 INFO L481 AbstractCegarLoop]: Abstraction has 12939 states and 13131 transitions. [2018-10-23 20:35:24,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 20:35:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 12939 states and 13131 transitions. [2018-10-23 20:35:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2018-10-23 20:35:24,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:35:24,738 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 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, 2, 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] [2018-10-23 20:35:24,738 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:35:24,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:35:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash 468784148, now seen corresponding path program 1 times [2018-10-23 20:35:24,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:35:24,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:35:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3910 backedges. 3071 proven. 60 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2018-10-23 20:35:27,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:35:27,177 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-23 20:35:27,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:27,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:35:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3910 backedges. 3008 proven. 87 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2018-10-23 20:35:29,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:35:29,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2018-10-23 20:35:29,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 20:35:29,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 20:35:29,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-23 20:35:29,010 INFO L87 Difference]: Start difference. First operand 12939 states and 13131 transitions. Second operand 11 states. [2018-10-23 20:35:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:36,411 INFO L93 Difference]: Finished difference Result 26721 states and 27116 transitions. [2018-10-23 20:35:36,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-23 20:35:36,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1363 [2018-10-23 20:35:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:36,426 INFO L225 Difference]: With dead ends: 26721 [2018-10-23 20:35:36,426 INFO L226 Difference]: Without dead ends: 15584 [2018-10-23 20:35:36,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1396 GetRequests, 1373 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2018-10-23 20:35:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15584 states. [2018-10-23 20:35:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15584 to 13541. [2018-10-23 20:35:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13541 states. [2018-10-23 20:35:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13541 states to 13541 states and 13737 transitions. [2018-10-23 20:35:36,613 INFO L78 Accepts]: Start accepts. Automaton has 13541 states and 13737 transitions. Word has length 1363 [2018-10-23 20:35:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:36,614 INFO L481 AbstractCegarLoop]: Abstraction has 13541 states and 13737 transitions. [2018-10-23 20:35:36,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 20:35:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 13541 states and 13737 transitions. [2018-10-23 20:35:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1590 [2018-10-23 20:35:36,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:35:36,638 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:35:36,638 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:35:36,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:35:36,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1571507525, now seen corresponding path program 1 times [2018-10-23 20:35:36,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:35:36,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:35:36,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:36,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:36,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5361 backedges. 3084 proven. 852 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2018-10-23 20:35:39,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:35:39,002 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-23 20:35:39,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:39,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:35:40,608 WARN L179 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 498 DAG size of output: 22 [2018-10-23 20:35:41,183 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 31 [2018-10-23 20:35:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5361 backedges. 3574 proven. 447 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2018-10-23 20:35:45,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:35:45,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-23 20:35:45,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:35:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:35:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-23 20:35:45,246 INFO L87 Difference]: Start difference. First operand 13541 states and 13737 transitions. Second operand 9 states. [2018-10-23 20:36:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:36:05,609 INFO L93 Difference]: Finished difference Result 25566 states and 25943 transitions. [2018-10-23 20:36:05,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-23 20:36:05,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1589 [2018-10-23 20:36:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:36:05,630 INFO L225 Difference]: With dead ends: 25566 [2018-10-23 20:36:05,630 INFO L226 Difference]: Without dead ends: 25564 [2018-10-23 20:36:05,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1602 GetRequests, 1591 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-10-23 20:36:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25564 states. [2018-10-23 20:36:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25564 to 15041. [2018-10-23 20:36:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15041 states. [2018-10-23 20:36:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15041 states to 15041 states and 15267 transitions. [2018-10-23 20:36:05,855 INFO L78 Accepts]: Start accepts. Automaton has 15041 states and 15267 transitions. Word has length 1589 [2018-10-23 20:36:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:36:05,856 INFO L481 AbstractCegarLoop]: Abstraction has 15041 states and 15267 transitions. [2018-10-23 20:36:05,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:36:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 15041 states and 15267 transitions. [2018-10-23 20:36:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1651 [2018-10-23 20:36:05,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:36:05,877 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:36:05,878 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:36:05,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:36:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash -869449899, now seen corresponding path program 1 times [2018-10-23 20:36:05,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:36:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:36:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:36:05,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:36:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:36:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:36:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2731 proven. 526 refuted. 0 times theorem prover too weak. 1784 trivial. 0 not checked. [2018-10-23 20:36:09,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:36:09,190 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-23 20:36:09,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:36:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:36:09,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-10-23 20:36:11,220 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-23 20:36:11,421 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:36:11,421 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 20:36:11,427 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 20:36:11,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:36:11 BoogieIcfgContainer [2018-10-23 20:36:11,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 20:36:11,428 INFO L168 Benchmark]: Toolchain (without parser) took 225543.02 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-23 20:36:11,429 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 20:36:11,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1187.76 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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-10-23 20:36:11,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 395.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -896.7 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-23 20:36:11,431 INFO L168 Benchmark]: Boogie Preprocessor took 179.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-10-23 20:36:11,435 INFO L168 Benchmark]: RCFGBuilder took 8531.13 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: 321.0 MB). Peak memory consumption was 321.0 MB. Max. memory is 7.1 GB. [2018-10-23 20:36:11,436 INFO L168 Benchmark]: TraceAbstraction took 215244.63 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-23 20:36:11,444 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1187.76 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: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 395.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -896.7 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 179.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8531.13 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: 321.0 MB). Peak memory consumption was 321.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 215244.63 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 154). Cancelled while BasicCegarLoop was analyzing trace of length 1651 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while DnfTransformerHelper was transforming 0 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. TIMEOUT Result, 215.1s OverallTime, 21 OverallIterations, 10 TraceHistogramMax, 153.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4109 SDtfs, 31549 SDslu, 3251 SDs, 0 SdLazy, 67253 SolverSat, 8002 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 126.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8545 GetRequests, 8380 SyntacticMatches, 29 SemanticMatches, 136 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18806occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 61122 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 33.5s InterpolantComputationTime, 24008 NumberOfCodeBlocks, 24008 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 23979 ConstructedInterpolants, 617 QuantifiedInterpolants, 111408972 SizeOfPredicates, 11 NumberOfNonLiveVariables, 9709 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 40318/45112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown