java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Primes.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:12:46,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:12:46,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:12:46,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:12:46,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:12:46,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:12:46,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:12:46,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:12:46,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:12:46,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:12:46,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:12:46,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:12:46,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:12:46,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:12:46,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:12:46,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:12:46,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:12:46,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:12:46,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:12:46,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:12:46,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:12:46,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:12:46,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:12:46,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:12:46,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:12:46,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:12:46,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:12:46,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:12:46,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:12:46,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:12:46,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:12:46,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:12:46,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:12:46,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:12:46,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:12:46,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:12:46,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:12:46,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:12:46,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:12:46,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:12:46,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:12:46,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:12:46,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:12:46,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:12:46,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:12:46,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:12:46,890 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:12:46,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:12:46,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:12:46,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:12:46,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:12:46,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:12:46,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:12:46,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:12:46,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:12:46,893 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:12:46,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:12:46,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:12:46,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:12:46,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:12:46,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:12:46,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:12:46,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:12:46,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:12:46,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:12:46,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:12:46,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:12:46,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:12:46,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:12:46,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:12:46,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:12:46,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:12:46,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:12:46,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:12:46,981 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:12:46,981 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:12:46,982 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Primes.c [2019-09-08 06:12:47,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c617c7577/7ec29263c7af452faca8607860a1848c/FLAGf1708f9ae [2019-09-08 06:12:47,481 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:12:47,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Primes.c [2019-09-08 06:12:47,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c617c7577/7ec29263c7af452faca8607860a1848c/FLAGf1708f9ae [2019-09-08 06:12:47,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c617c7577/7ec29263c7af452faca8607860a1848c [2019-09-08 06:12:47,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:12:47,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:12:47,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:12:47,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:12:47,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:12:47,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:12:47" (1/1) ... [2019-09-08 06:12:47,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248babf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:47, skipping insertion in model container [2019-09-08 06:12:47,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:12:47" (1/1) ... [2019-09-08 06:12:47,858 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:12:47,880 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:12:48,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:12:48,137 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:12:48,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:12:48,263 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:12:48,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48 WrapperNode [2019-09-08 06:12:48,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:12:48,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:12:48,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:12:48,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:12:48,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... [2019-09-08 06:12:48,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:12:48,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:12:48,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:12:48,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:12:48,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 06:12:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:12:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:12:48,355 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-09-08 06:12:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2019-09-08 06:12:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime [2019-09-08 06:12:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2019-09-08 06:12:48,356 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:12:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:12:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:12:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-09-08 06:12:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2019-09-08 06:12:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2019-09-08 06:12:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime [2019-09-08 06:12:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:12:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:12:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:12:48,702 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:12:48,703 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 06:12:48,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:12:48 BoogieIcfgContainer [2019-09-08 06:12:48,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:12:48,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:12:48,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:12:48,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:12:48,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:12:47" (1/3) ... [2019-09-08 06:12:48,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da29a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:12:48, skipping insertion in model container [2019-09-08 06:12:48,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:12:48" (2/3) ... [2019-09-08 06:12:48,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da29a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:12:48, skipping insertion in model container [2019-09-08 06:12:48,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:12:48" (3/3) ... [2019-09-08 06:12:48,712 INFO L109 eAbstractionObserver]: Analyzing ICFG Primes.c [2019-09-08 06:12:48,720 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:12:48,727 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:12:48,743 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:12:48,776 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:12:48,776 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:12:48,777 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:12:48,777 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:12:48,777 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:12:48,777 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:12:48,777 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:12:48,778 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:12:48,778 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:12:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-09-08 06:12:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 06:12:48,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:48,805 INFO L399 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] [2019-09-08 06:12:48,807 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1011403708, now seen corresponding path program 1 times [2019-09-08 06:12:48,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:48,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:48,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:48,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:48,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:12:48,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:12:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:12:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:12:49,003 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2019-09-08 06:12:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:49,055 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-09-08 06:12:49,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:12:49,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-08 06:12:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:49,066 INFO L225 Difference]: With dead ends: 67 [2019-09-08 06:12:49,066 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 06:12:49,069 INFO L628 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 [2019-09-08 06:12:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 06:12:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-08 06:12:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-08 06:12:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2019-09-08 06:12:49,117 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 22 [2019-09-08 06:12:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:49,120 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-09-08 06:12:49,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:12:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2019-09-08 06:12:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 06:12:49,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:49,124 INFO L399 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] [2019-09-08 06:12:49,125 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:49,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2066239412, now seen corresponding path program 1 times [2019-09-08 06:12:49,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:49,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:49,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:12:49,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:12:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:12:49,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:12:49,268 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 8 states. [2019-09-08 06:12:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:49,347 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2019-09-08 06:12:49,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:12:49,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-09-08 06:12:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:49,352 INFO L225 Difference]: With dead ends: 80 [2019-09-08 06:12:49,353 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 06:12:49,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:12:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 06:12:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-08 06:12:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 06:12:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2019-09-08 06:12:49,377 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 29 [2019-09-08 06:12:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:49,378 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2019-09-08 06:12:49,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:12:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2019-09-08 06:12:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 06:12:49,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:49,383 INFO L399 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] [2019-09-08 06:12:49,384 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash 925502914, now seen corresponding path program 1 times [2019-09-08 06:12:49,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:49,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:49,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:49,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:49,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:49,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:12:49,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:12:49,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:12:49,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:12:49,464 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand 5 states. [2019-09-08 06:12:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:49,539 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2019-09-08 06:12:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:12:49,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-08 06:12:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:49,542 INFO L225 Difference]: With dead ends: 64 [2019-09-08 06:12:49,542 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 06:12:49,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 06:12:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-08 06:12:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 06:12:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2019-09-08 06:12:49,558 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 30 [2019-09-08 06:12:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:49,559 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-09-08 06:12:49,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:12:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2019-09-08 06:12:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 06:12:49,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:49,564 INFO L399 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] [2019-09-08 06:12:49,565 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:49,567 INFO L82 PathProgramCache]: Analyzing trace with hash -680413659, now seen corresponding path program 1 times [2019-09-08 06:12:49,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:49,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:49,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:49,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:12:49,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:49,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:12:49,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:12:49,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:12:49,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:12:49,675 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand 5 states. [2019-09-08 06:12:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:49,759 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2019-09-08 06:12:49,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:12:49,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-09-08 06:12:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:49,762 INFO L225 Difference]: With dead ends: 66 [2019-09-08 06:12:49,762 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 06:12:49,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:12:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 06:12:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-09-08 06:12:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 06:12:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2019-09-08 06:12:49,774 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 31 [2019-09-08 06:12:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:49,774 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-09-08 06:12:49,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:12:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2019-09-08 06:12:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 06:12:49,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:49,777 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:12:49,777 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:49,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1918898322, now seen corresponding path program 1 times [2019-09-08 06:12:49,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:49,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:12:49,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:49,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:12:49,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:50,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:12:50,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:12:50,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:50,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 06:12:50,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:12:50,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:12:50,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:12:50,080 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand 7 states. [2019-09-08 06:12:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:50,224 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2019-09-08 06:12:50,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:12:50,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-09-08 06:12:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:50,228 INFO L225 Difference]: With dead ends: 75 [2019-09-08 06:12:50,228 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 06:12:50,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:12:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 06:12:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-08 06:12:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 06:12:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-09-08 06:12:50,237 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 38 [2019-09-08 06:12:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:50,238 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-09-08 06:12:50,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:12:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-09-08 06:12:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 06:12:50,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:50,240 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:12:50,240 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:50,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:50,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1144159485, now seen corresponding path program 1 times [2019-09-08 06:12:50,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:50,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:50,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:12:50,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:50,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 06:12:50,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:50,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 06:12:50,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:50,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:12:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:12:50,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:50,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-09-08 06:12:50,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 06:12:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 06:12:50,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:12:50,610 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 15 states. [2019-09-08 06:12:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:50,934 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2019-09-08 06:12:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:12:50,935 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-09-08 06:12:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:50,937 INFO L225 Difference]: With dead ends: 82 [2019-09-08 06:12:50,937 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 06:12:50,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:12:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 06:12:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-09-08 06:12:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-08 06:12:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2019-09-08 06:12:50,965 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 39 [2019-09-08 06:12:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:50,966 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2019-09-08 06:12:50,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 06:12:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2019-09-08 06:12:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 06:12:50,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:50,973 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:12:50,974 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash -885721633, now seen corresponding path program 1 times [2019-09-08 06:12:50,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:50,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:50,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:50,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:12:51,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:12:51,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 06:12:51,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:12:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:12:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:12:51,049 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 7 states. [2019-09-08 06:12:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:51,140 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2019-09-08 06:12:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:12:51,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-08 06:12:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:51,142 INFO L225 Difference]: With dead ends: 114 [2019-09-08 06:12:51,142 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 06:12:51,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:12:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 06:12:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-09-08 06:12:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-08 06:12:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2019-09-08 06:12:51,155 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 41 [2019-09-08 06:12:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:51,156 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2019-09-08 06:12:51,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:12:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2019-09-08 06:12:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 06:12:51,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:51,158 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:12:51,158 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:51,159 INFO L82 PathProgramCache]: Analyzing trace with hash 85935973, now seen corresponding path program 2 times [2019-09-08 06:12:51,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:51,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:51,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:51,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:12:51,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 06:12:51,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:51,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:12:51,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:12:51,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:12:51,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:51,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 06:12:51,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:51,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:12:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 06:12:51,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:51,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 20 [2019-09-08 06:12:51,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:12:51,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:12:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:12:51,601 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 20 states. [2019-09-08 06:12:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:52,032 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2019-09-08 06:12:52,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:12:52,032 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-09-08 06:12:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:52,034 INFO L225 Difference]: With dead ends: 85 [2019-09-08 06:12:52,034 INFO L226 Difference]: Without dead ends: 81 [2019-09-08 06:12:52,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-09-08 06:12:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-08 06:12:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2019-09-08 06:12:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-08 06:12:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-09-08 06:12:52,046 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 47 [2019-09-08 06:12:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:52,047 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-09-08 06:12:52,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:12:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-09-08 06:12:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 06:12:52,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:52,048 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:52,048 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash 911848899, now seen corresponding path program 3 times [2019-09-08 06:12:52,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:52,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:52,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:52,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:52,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:12:52,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:52,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 06:12:52,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:12:52,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 06:12:52,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:52,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 06:12:52,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:12:53,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:12:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:12:53,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:12:53,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 24 [2019-09-08 06:12:53,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 06:12:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 06:12:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=496, Unknown=1, NotChecked=0, Total=552 [2019-09-08 06:12:53,137 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 24 states. [2019-09-08 06:12:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:12:55,649 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2019-09-08 06:12:55,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:12:55,654 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2019-09-08 06:12:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:12:55,656 INFO L225 Difference]: With dead ends: 88 [2019-09-08 06:12:55,656 INFO L226 Difference]: Without dead ends: 84 [2019-09-08 06:12:55,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=896, Unknown=1, NotChecked=0, Total=992 [2019-09-08 06:12:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-08 06:12:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-09-08 06:12:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-08 06:12:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2019-09-08 06:12:55,667 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 55 [2019-09-08 06:12:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:12:55,668 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-09-08 06:12:55,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 06:12:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2019-09-08 06:12:55,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 06:12:55,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:12:55,669 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:12:55,670 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:12:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:12:55,670 INFO L82 PathProgramCache]: Analyzing trace with hash -966039387, now seen corresponding path program 4 times [2019-09-08 06:12:55,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:12:55,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:12:55,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:55,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:12:55,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:12:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:12:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 06:12:55,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:12:55,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 06:12:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:12:56,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:12:56,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:12:56,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 06:12:56,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:08,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:13:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 2 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 06:13:08,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:08,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 27 [2019-09-08 06:13:08,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 06:13:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 06:13:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=637, Unknown=2, NotChecked=0, Total=702 [2019-09-08 06:13:08,975 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 27 states. [2019-09-08 06:13:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:09,714 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2019-09-08 06:13:09,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 06:13:09,715 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2019-09-08 06:13:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:09,716 INFO L225 Difference]: With dead ends: 91 [2019-09-08 06:13:09,717 INFO L226 Difference]: Without dead ends: 87 [2019-09-08 06:13:09,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=107, Invalid=1151, Unknown=2, NotChecked=0, Total=1260 [2019-09-08 06:13:09,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-08 06:13:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-09-08 06:13:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-08 06:13:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-09-08 06:13:09,730 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 63 [2019-09-08 06:13:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:09,731 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-09-08 06:13:09,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 06:13:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2019-09-08 06:13:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 06:13:09,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:09,736 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:09,736 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:09,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:09,737 INFO L82 PathProgramCache]: Analyzing trace with hash -605726589, now seen corresponding path program 5 times [2019-09-08 06:13:09,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:09,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:09,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:13:10,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:10,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 06:13:10,098 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:13:10,136 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 06:13:10,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:10,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 06:13:10,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:18,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:13:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:13:18,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:18,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 32 [2019-09-08 06:13:18,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 06:13:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 06:13:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=909, Unknown=6, NotChecked=0, Total=992 [2019-09-08 06:13:18,072 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 32 states. [2019-09-08 06:13:19,076 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 06:13:19,574 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-08 06:13:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:19,723 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2019-09-08 06:13:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 06:13:19,723 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-09-08 06:13:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:19,725 INFO L225 Difference]: With dead ends: 94 [2019-09-08 06:13:19,725 INFO L226 Difference]: Without dead ends: 90 [2019-09-08 06:13:19,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=127, Invalid=1589, Unknown=6, NotChecked=0, Total=1722 [2019-09-08 06:13:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-08 06:13:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2019-09-08 06:13:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-08 06:13:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2019-09-08 06:13:19,735 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 71 [2019-09-08 06:13:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:19,736 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-09-08 06:13:19,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 06:13:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2019-09-08 06:13:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 06:13:19,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:19,738 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 06:13:19,738 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:19,738 INFO L82 PathProgramCache]: Analyzing trace with hash 610390869, now seen corresponding path program 1 times [2019-09-08 06:13:19,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:19,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:19,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:19,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:19,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 06:13:19,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:13:19,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:13:19,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:13:19,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:13:19,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:13:19,779 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand 5 states. [2019-09-08 06:13:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:19,825 INFO L93 Difference]: Finished difference Result 171 states and 218 transitions. [2019-09-08 06:13:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:13:19,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-08 06:13:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:19,829 INFO L225 Difference]: With dead ends: 171 [2019-09-08 06:13:19,829 INFO L226 Difference]: Without dead ends: 88 [2019-09-08 06:13:19,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:13:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-08 06:13:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-09-08 06:13:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-08 06:13:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2019-09-08 06:13:19,846 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 67 [2019-09-08 06:13:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:19,846 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2019-09-08 06:13:19,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:13:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2019-09-08 06:13:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 06:13:19,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:19,851 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 06:13:19,851 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:19,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1914779091, now seen corresponding path program 1 times [2019-09-08 06:13:19,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:19,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:19,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:13:19,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:19,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:13:19,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:19,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 06:13:19,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:13:19,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:13:19,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2019-09-08 06:13:19,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:13:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:13:19,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:13:19,976 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 5 states. [2019-09-08 06:13:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:20,026 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2019-09-08 06:13:20,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:13:20,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 06:13:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:20,028 INFO L225 Difference]: With dead ends: 161 [2019-09-08 06:13:20,028 INFO L226 Difference]: Without dead ends: 86 [2019-09-08 06:13:20,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:13:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-08 06:13:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-08 06:13:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-08 06:13:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2019-09-08 06:13:20,036 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 68 [2019-09-08 06:13:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:20,036 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2019-09-08 06:13:20,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:13:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2019-09-08 06:13:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 06:13:20,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:20,038 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:20,038 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:20,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1563040229, now seen corresponding path program 6 times [2019-09-08 06:13:20,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:20,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:20,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-08 06:13:20,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:20,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 06:13:20,352 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:13:20,394 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 06:13:20,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:20,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 06:13:20,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:14:08,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:14:11,952 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-09-08 06:14:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-08 06:14:11,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:14:11,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2019-09-08 06:14:11,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 06:14:11,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 06:14:11,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1016, Unknown=23, NotChecked=0, Total=1122 [2019-09-08 06:14:11,973 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 34 states. [2019-09-08 06:14:48,038 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 06:15:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:15:26,365 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-09-08 06:15:26,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 06:15:26,365 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 79 [2019-09-08 06:15:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:15:26,367 INFO L225 Difference]: With dead ends: 97 [2019-09-08 06:15:26,367 INFO L226 Difference]: Without dead ends: 93 [2019-09-08 06:15:26,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=129, Invalid=1740, Unknown=23, NotChecked=0, Total=1892 [2019-09-08 06:15:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-08 06:15:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-09-08 06:15:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-08 06:15:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-09-08 06:15:26,376 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 79 [2019-09-08 06:15:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:15:26,377 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-09-08 06:15:26,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 06:15:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-09-08 06:15:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 06:15:26,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:15:26,378 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:15:26,378 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:15:26,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:15:26,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1511811907, now seen corresponding path program 7 times [2019-09-08 06:15:26,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:15:26,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:15:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:26,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:15:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:15:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 06:15:26,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:15:26,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 06:15:26,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:15:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:15:26,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 06:15:26,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:15:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:15:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 06:15:42,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:15:42,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 39 [2019-09-08 06:15:42,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 06:15:42,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 06:15:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1375, Unknown=11, NotChecked=0, Total=1482 [2019-09-08 06:15:42,980 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 39 states. [2019-09-08 06:15:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:15:50,295 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2019-09-08 06:15:50,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 06:15:50,296 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 87 [2019-09-08 06:15:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:15:50,297 INFO L225 Difference]: With dead ends: 103 [2019-09-08 06:15:50,298 INFO L226 Difference]: Without dead ends: 99 [2019-09-08 06:15:50,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=155, Invalid=2384, Unknown=11, NotChecked=0, Total=2550 [2019-09-08 06:15:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-08 06:15:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-09-08 06:15:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-08 06:15:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-09-08 06:15:50,307 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 87 [2019-09-08 06:15:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:15:50,308 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-09-08 06:15:50,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 06:15:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-09-08 06:15:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 06:15:50,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:15:50,309 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:15:50,310 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:15:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:15:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1546607397, now seen corresponding path program 8 times [2019-09-08 06:15:50,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:15:50,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:15:50,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:50,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:15:50,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:15:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:15:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 06:15:50,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:15:50,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 06:15:50,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:15:50,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:15:50,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:15:50,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 06:15:50,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:17:15,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:17:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 06:17:15,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:17:15,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 43 [2019-09-08 06:17:15,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 06:17:15,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 06:17:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1660, Unknown=39, NotChecked=0, Total=1806 [2019-09-08 06:17:15,894 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 43 states. [2019-09-08 06:17:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:17:17,187 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2019-09-08 06:17:17,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 06:17:17,188 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 95 [2019-09-08 06:17:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:17:17,189 INFO L225 Difference]: With dead ends: 103 [2019-09-08 06:17:17,190 INFO L226 Difference]: Without dead ends: 99 [2019-09-08 06:17:17,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 85.7s TimeCoverageRelationStatistics Valid=171, Invalid=2870, Unknown=39, NotChecked=0, Total=3080 [2019-09-08 06:17:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-08 06:17:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-09-08 06:17:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-08 06:17:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-09-08 06:17:17,209 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 95 [2019-09-08 06:17:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:17:17,209 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-09-08 06:17:17,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 06:17:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-09-08 06:17:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 06:17:17,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:17:17,213 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 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] [2019-09-08 06:17:17,213 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:17:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:17:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash 785756517, now seen corresponding path program 1 times [2019-09-08 06:17:17,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:17:17,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:17:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:17,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:17:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-09-08 06:17:17,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:17:17,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:17:17,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:17:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:17,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 06:17:17,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:17:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-09-08 06:17:17,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:17:17,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-08 06:17:17,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:17:17,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:17:17,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:17:17,396 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 10 states. [2019-09-08 06:17:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:17:17,607 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2019-09-08 06:17:17,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:17:17,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2019-09-08 06:17:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:17:17,611 INFO L225 Difference]: With dead ends: 163 [2019-09-08 06:17:17,611 INFO L226 Difference]: Without dead ends: 98 [2019-09-08 06:17:17,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 06:17:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-08 06:17:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-09-08 06:17:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-08 06:17:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2019-09-08 06:17:17,630 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 109 [2019-09-08 06:17:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:17:17,632 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2019-09-08 06:17:17,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:17:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2019-09-08 06:17:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 06:17:17,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:17:17,635 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:17:17,635 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:17:17,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:17:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1839918595, now seen corresponding path program 9 times [2019-09-08 06:17:17,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:17:17,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:17:17,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:17,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:17:17,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:17:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:17:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-09-08 06:17:18,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:17:18,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:17:18,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:17:18,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 06:17:18,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:17:18,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 06:17:18,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:18:33,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:18:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-09-08 06:18:33,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:18:33,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 47 [2019-09-08 06:18:33,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 06:18:33,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 06:18:33,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2010, Unknown=34, NotChecked=0, Total=2162 [2019-09-08 06:18:33,083 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 47 states. [2019-09-08 06:18:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:18:43,419 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2019-09-08 06:18:43,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 06:18:43,420 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 103 [2019-09-08 06:18:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:18:43,421 INFO L225 Difference]: With dead ends: 109 [2019-09-08 06:18:43,422 INFO L226 Difference]: Without dead ends: 105 [2019-09-08 06:18:43,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 75.5s TimeCoverageRelationStatistics Valid=187, Invalid=3439, Unknown=34, NotChecked=0, Total=3660 [2019-09-08 06:18:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-08 06:18:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2019-09-08 06:18:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-08 06:18:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2019-09-08 06:18:43,430 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 103 [2019-09-08 06:18:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:18:43,431 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2019-09-08 06:18:43,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 06:18:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2019-09-08 06:18:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:18:43,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:18:43,433 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-08 06:18:43,433 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:18:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:18:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash 627784383, now seen corresponding path program 2 times [2019-09-08 06:18:43,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:18:43,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:18:43,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:18:43,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:18:43,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:18:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:18:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 06:18:43,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:18:43,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:18:43,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:18:43,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:18:43,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:18:43,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 06:18:43,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:18:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:18:43,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:18:43,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-09-08 06:18:43,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 06:18:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 06:18:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:18:43,712 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand 15 states. [2019-09-08 06:18:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:18:44,126 INFO L93 Difference]: Finished difference Result 181 states and 232 transitions. [2019-09-08 06:18:44,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:18:44,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2019-09-08 06:18:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:18:44,129 INFO L225 Difference]: With dead ends: 181 [2019-09-08 06:18:44,129 INFO L226 Difference]: Without dead ends: 124 [2019-09-08 06:18:44,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:18:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-08 06:18:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2019-09-08 06:18:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-08 06:18:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2019-09-08 06:18:44,144 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 78 [2019-09-08 06:18:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:18:44,144 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2019-09-08 06:18:44,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 06:18:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2019-09-08 06:18:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 06:18:44,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:18:44,147 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 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] [2019-09-08 06:18:44,147 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:18:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:18:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash -715904051, now seen corresponding path program 1 times [2019-09-08 06:18:44,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:18:44,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:18:44,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:18:44,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:18:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:18:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:18:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-08 06:18:44,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:18:44,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:18:44,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:18:44,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:18:44,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:18:44,202 INFO L87 Difference]: Start difference. First operand 114 states and 146 transitions. Second operand 5 states. [2019-09-08 06:18:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:18:44,260 INFO L93 Difference]: Finished difference Result 219 states and 301 transitions. [2019-09-08 06:18:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:18:44,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-08 06:18:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:18:44,262 INFO L225 Difference]: With dead ends: 219 [2019-09-08 06:18:44,262 INFO L226 Difference]: Without dead ends: 114 [2019-09-08 06:18:44,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:18:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-08 06:18:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-08 06:18:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-08 06:18:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2019-09-08 06:18:44,277 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 125 [2019-09-08 06:18:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:18:44,278 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-09-08 06:18:44,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:18:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2019-09-08 06:18:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 06:18:44,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:18:44,281 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:18:44,282 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:18:44,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:18:44,282 INFO L82 PathProgramCache]: Analyzing trace with hash -414241691, now seen corresponding path program 10 times [2019-09-08 06:18:44,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:18:44,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:18:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:18:44,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:18:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:18:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:18:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-08 06:18:45,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:18:45,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:18:45,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:18:45,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:18:45,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:18:45,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 06:18:45,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:19:42,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:19:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-08 06:19:42,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:19:42,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 52 [2019-09-08 06:19:42,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 06:19:42,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 06:19:42,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2491, Unknown=29, NotChecked=0, Total=2652 [2019-09-08 06:19:42,317 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand 52 states. [2019-09-08 06:19:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:19:52,021 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2019-09-08 06:19:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 06:19:52,024 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 111 [2019-09-08 06:19:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:19:52,026 INFO L225 Difference]: With dead ends: 125 [2019-09-08 06:19:52,026 INFO L226 Difference]: Without dead ends: 121 [2019-09-08 06:19:52,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=207, Invalid=4186, Unknown=29, NotChecked=0, Total=4422 [2019-09-08 06:19:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-08 06:19:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-09-08 06:19:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-08 06:19:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2019-09-08 06:19:52,036 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 111 [2019-09-08 06:19:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:19:52,036 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2019-09-08 06:19:52,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 06:19:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2019-09-08 06:19:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 06:19:52,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:19:52,038 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:19:52,038 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:19:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:19:52,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1573068605, now seen corresponding path program 11 times [2019-09-08 06:19:52,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:19:52,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:19:52,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:19:52,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:19:52,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:19:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:19:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-08 06:19:52,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:19:52,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:19:52,658 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:19:52,706 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 06:19:52,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:19:52,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 06:19:52,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:20:27,535 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 06:21:16,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:21:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-08 06:21:16,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:21:16,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 55 [2019-09-08 06:21:16,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 06:21:16,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 06:21:16,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2792, Unknown=38, NotChecked=0, Total=2970 [2019-09-08 06:21:16,824 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand 55 states. [2019-09-08 06:21:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:21:19,129 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2019-09-08 06:21:19,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 06:21:19,133 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 119 [2019-09-08 06:21:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:21:19,135 INFO L225 Difference]: With dead ends: 128 [2019-09-08 06:21:19,135 INFO L226 Difference]: Without dead ends: 124 [2019-09-08 06:21:19,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 85.2s TimeCoverageRelationStatistics Valid=219, Invalid=4713, Unknown=38, NotChecked=0, Total=4970 [2019-09-08 06:21:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-08 06:21:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-09-08 06:21:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-08 06:21:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2019-09-08 06:21:19,159 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 119 [2019-09-08 06:21:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:21:19,160 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2019-09-08 06:21:19,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 06:21:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2019-09-08 06:21:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 06:21:19,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:21:19,163 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 5, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 06:21:19,163 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:21:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:21:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -636599737, now seen corresponding path program 2 times [2019-09-08 06:21:19,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:21:19,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:21:19,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:19,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:21:19,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:21:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-08 06:21:19,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:21:19,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:21:19,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:21:19,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:21:19,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:21:19,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 06:21:19,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:21:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 39 proven. 19 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:21:19,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:21:19,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-09-08 06:21:19,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:21:19,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:21:19,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:21:19,515 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand 12 states. [2019-09-08 06:21:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:21:19,655 INFO L93 Difference]: Finished difference Result 210 states and 266 transitions. [2019-09-08 06:21:19,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:21:19,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2019-09-08 06:21:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:21:19,659 INFO L225 Difference]: With dead ends: 210 [2019-09-08 06:21:19,659 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 06:21:19,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:21:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 06:21:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-08 06:21:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-08 06:21:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-08 06:21:19,666 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 166 [2019-09-08 06:21:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:21:19,667 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-08 06:21:19,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:21:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-08 06:21:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 06:21:19,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:21:19,668 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:21:19,669 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:21:19,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:21:19,669 INFO L82 PathProgramCache]: Analyzing trace with hash -211972699, now seen corresponding path program 12 times [2019-09-08 06:21:19,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:21:19,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:21:19,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:19,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:21:19,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:21:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:21:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-08 06:21:20,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:21:20,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:21:20,500 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:21:20,573 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 06:21:20,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:21:20,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 06:21:20,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:22:30,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:22:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-08 06:22:30,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:22:30,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 59 [2019-09-08 06:22:30,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 06:22:30,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 06:22:30,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3236, Unknown=35, NotChecked=0, Total=3422 [2019-09-08 06:22:30,672 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 59 states. [2019-09-08 06:22:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:22:48,519 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-09-08 06:22:48,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 06:22:48,520 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 127 [2019-09-08 06:22:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:22:48,521 INFO L225 Difference]: With dead ends: 76 [2019-09-08 06:22:48,522 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 06:22:48,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 71.2s TimeCoverageRelationStatistics Valid=235, Invalid=5430, Unknown=35, NotChecked=0, Total=5700 [2019-09-08 06:22:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 06:22:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-08 06:22:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-08 06:22:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-08 06:22:48,529 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 127 [2019-09-08 06:22:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:22:48,533 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-08 06:22:48,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 06:22:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-08 06:22:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 06:22:48,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:22:48,534 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:22:48,534 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:22:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:22:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash 310264707, now seen corresponding path program 13 times [2019-09-08 06:22:48,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:22:48,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:22:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:48,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:22:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:22:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:22:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2019-09-08 06:22:49,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:22:49,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:22:49,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:22:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:22:49,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 06:22:49,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:23:12,821 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-08 06:24:28,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:24:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2019-09-08 06:24:28,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:24:28,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 64 [2019-09-08 06:24:28,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-08 06:24:28,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-08 06:24:28,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3820, Unknown=47, NotChecked=0, Total=4032 [2019-09-08 06:24:28,945 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 64 states. [2019-09-08 06:24:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:24:39,780 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-09-08 06:24:39,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 06:24:39,780 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 135 [2019-09-08 06:24:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:24:39,782 INFO L225 Difference]: With dead ends: 79 [2019-09-08 06:24:39,782 INFO L226 Difference]: Without dead ends: 75 [2019-09-08 06:24:39,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 100.8s TimeCoverageRelationStatistics Valid=255, Invalid=6340, Unknown=47, NotChecked=0, Total=6642 [2019-09-08 06:24:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-08 06:24:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-08 06:24:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 06:24:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-08 06:24:39,791 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 135 [2019-09-08 06:24:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:24:39,792 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-08 06:24:39,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-08 06:24:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-08 06:24:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 06:24:39,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:24:39,793 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:24:39,793 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:24:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:24:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2043773211, now seen corresponding path program 14 times [2019-09-08 06:24:39,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:24:39,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:24:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:24:39,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:24:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:24:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:24:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-09-08 06:24:40,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:24:40,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:24:40,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:24:40,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:24:40,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:24:40,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-08 06:24:40,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:04,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 06:26:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-09-08 06:26:04,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:04,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 66 [2019-09-08 06:26:04,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-08 06:26:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-08 06:26:04,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4082, Unknown=38, NotChecked=0, Total=4290 [2019-09-08 06:26:04,403 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 66 states. [2019-09-08 06:26:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:28,407 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-09-08 06:26:28,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 06:26:28,408 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 143 [2019-09-08 06:26:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:28,409 INFO L225 Difference]: With dead ends: 82 [2019-09-08 06:26:28,410 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 06:26:28,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 85.0s TimeCoverageRelationStatistics Valid=263, Invalid=6839, Unknown=38, NotChecked=0, Total=7140 [2019-09-08 06:26:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 06:26:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-08 06:26:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-08 06:26:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-08 06:26:28,416 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 143 [2019-09-08 06:26:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:28,417 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-08 06:26:28,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-08 06:26:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-08 06:26:28,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 06:26:28,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:28,418 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:28,419 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:28,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:28,419 INFO L82 PathProgramCache]: Analyzing trace with hash 672863811, now seen corresponding path program 15 times [2019-09-08 06:26:28,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:28,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:28,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:28,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:26:28,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-09-08 06:26:29,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:29,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:26:29,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:26:29,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 06:26:29,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:26:29,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 06:26:29,676 INFO L279 TraceCheckSpWp]: Computing forward predicates...