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/loop-acceleration/array_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:24:40,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:24:40,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:24:40,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:24:40,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:24:40,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:24:40,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:24:40,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:24:40,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:24:40,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:24:40,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:24:40,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:24:40,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:24:40,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:24:40,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:24:40,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:24:40,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:24:40,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:24:40,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:24:40,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:24:40,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:24:40,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:24:40,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:24:40,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:24:40,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:24:40,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:24:40,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:24:40,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:24:40,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:24:40,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:24:40,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:24:40,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:24:40,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:24:40,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:24:40,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:24:40,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:24:40,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:24:40,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:24:40,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:24:40,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:24:40,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:24:40,072 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-03 19:24:40,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:24:40,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:24:40,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:24:40,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:24:40,096 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:24:40,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:24:40,096 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:24:40,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:24:40,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:24:40,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:24:40,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:24:40,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:24:40,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:24:40,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:24:40,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:24:40,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:24:40,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:24:40,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:24:40,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:24:40,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:24:40,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:24:40,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:24:40,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:24:40,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:24:40,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:24:40,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:24:40,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:24:40,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:24:40,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:24:40,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:24:40,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:24:40,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:24:40,158 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:24:40,158 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:24:40,159 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-2.i [2019-09-03 19:24:40,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64067ed7b/b1ccbafbf2d849e583713c82ddf5d70e/FLAGf55ce4310 [2019-09-03 19:24:40,661 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:24:40,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2.i [2019-09-03 19:24:40,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64067ed7b/b1ccbafbf2d849e583713c82ddf5d70e/FLAGf55ce4310 [2019-09-03 19:24:41,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64067ed7b/b1ccbafbf2d849e583713c82ddf5d70e [2019-09-03 19:24:41,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:24:41,044 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:24:41,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:24:41,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:24:41,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:24:41,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:24:41" (1/1) ... [2019-09-03 19:24:41,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b675fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41, skipping insertion in model container [2019-09-03 19:24:41,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:24:41" (1/1) ... [2019-09-03 19:24:41,061 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:24:41,076 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:24:41,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:24:41,234 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:24:41,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:24:41,271 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:24:41,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41 WrapperNode [2019-09-03 19:24:41,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:24:41,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:24:41,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:24:41,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:24:41,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41" (1/1) ... [2019-09-03 19:24:41,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41" (1/1) ... [2019-09-03 19:24:41,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41" (1/1) ... [2019-09-03 19:24:41,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41" (1/1) ... [2019-09-03 19:24:41,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41" (1/1) ... [2019-09-03 19:24:41,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41" (1/1) ... [2019-09-03 19:24:41,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41" (1/1) ... [2019-09-03 19:24:41,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:24:41,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:24:41,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:24:41,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:24:41,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41" (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-03 19:24:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:24:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:24:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:24:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:24:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:24:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:24:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:24:41,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:24:41,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:24:41,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:24:41,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:24:41,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:24:41,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:24:41,681 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:24:41,681 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:24:41,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:24:41 BoogieIcfgContainer [2019-09-03 19:24:41,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:24:41,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:24:41,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:24:41,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:24:41,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:24:41" (1/3) ... [2019-09-03 19:24:41,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d424dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:24:41, skipping insertion in model container [2019-09-03 19:24:41,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:41" (2/3) ... [2019-09-03 19:24:41,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d424dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:24:41, skipping insertion in model container [2019-09-03 19:24:41,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:24:41" (3/3) ... [2019-09-03 19:24:41,708 INFO L109 eAbstractionObserver]: Analyzing ICFG array_2-2.i [2019-09-03 19:24:41,733 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:24:41,747 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:24:41,769 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:24:41,798 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:24:41,799 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:24:41,799 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:24:41,799 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:24:41,799 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:24:41,799 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:24:41,799 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:24:41,800 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:24:41,800 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:24:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-03 19:24:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:24:41,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:41,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:41,824 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:41,828 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2019-09-03 19:24:41,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:41,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:41,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:41,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:41,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:41,949 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-03 19:24:41,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:24:41,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:24:41,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:24:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:24:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:24:41,969 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-03 19:24:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:41,993 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-03 19:24:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:24:41,995 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-09-03 19:24:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:42,004 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:24:42,004 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:24:42,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:24:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:24:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 19:24:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 19:24:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 19:24:42,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-03 19:24:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:42,052 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 19:24:42,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:24:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 19:24:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:24:42,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:42,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:42,053 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2019-09-03 19:24:42,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:42,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:42,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:42,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:42,164 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-03 19:24:42,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:24:42,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:24:42,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:24:42,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:24:42,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:24:42,168 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2019-09-03 19:24:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:42,212 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 19:24:42,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:24:42,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-03 19:24:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:42,214 INFO L225 Difference]: With dead ends: 22 [2019-09-03 19:24:42,214 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:24:42,215 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-03 19:24:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:24:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-03 19:24:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:24:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 19:24:42,220 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-03 19:24:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:42,221 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 19:24:42,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:24:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 19:24:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:24:42,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:42,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:42,222 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:42,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:42,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2019-09-03 19:24:42,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:42,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:42,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:42,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:42,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:42,313 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:42,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:42,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 19:24:42,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:42,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:42,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:24:42,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:24:42,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:24:42,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:24:42,436 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-03 19:24:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:42,476 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 19:24:42,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:24:42,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 19:24:42,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:42,478 INFO L225 Difference]: With dead ends: 24 [2019-09-03 19:24:42,478 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:24:42,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:24:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:24:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 19:24:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:24:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 19:24:42,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-03 19:24:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:42,485 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 19:24:42,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:24:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 19:24:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:24:42,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:42,486 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:42,486 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728289, now seen corresponding path program 2 times [2019-09-03 19:24:42,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:42,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:42,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:42,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:42,544 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-03 19:24:42,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:42,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:42,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:42,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:24:42,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:42,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:42,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:24:42,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:24:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:24:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:24:42,628 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-03 19:24:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:42,660 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 19:24:42,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:24:42,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-03 19:24:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:42,662 INFO L225 Difference]: With dead ends: 26 [2019-09-03 19:24:42,662 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:24:42,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:24:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:24:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-03 19:24:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:24:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 19:24:42,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-03 19:24:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:42,668 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 19:24:42,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:24:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 19:24:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:24:42,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:42,669 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:42,670 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:42,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:42,670 INFO L82 PathProgramCache]: Analyzing trace with hash 676582787, now seen corresponding path program 3 times [2019-09-03 19:24:42,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:42,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:42,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:42,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:42,738 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-03 19:24:42,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:42,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:24:42,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:42,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:24:42,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:42,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:42,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:24:42,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:24:42,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:24:42,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:24:42,808 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-03 19:24:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:42,856 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 19:24:42,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:24:42,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-03 19:24:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:42,859 INFO L225 Difference]: With dead ends: 28 [2019-09-03 19:24:42,859 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:24:42,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:24:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:24:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 19:24:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:24:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 19:24:42,868 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-03 19:24:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:42,871 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 19:24:42,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:24:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 19:24:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:24:42,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:42,874 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:42,874 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:42,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:42,875 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 4 times [2019-09-03 19:24:42,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:42,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:42,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:42,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:43,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:43,014 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) [2019-09-03 19:24:43,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:43,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:43,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:43,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:24:43,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:43,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:43,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:24:43,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:24:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:24:43,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:24:43,105 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-03 19:24:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:43,154 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 19:24:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:24:43,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-03 19:24:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:43,156 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:24:43,156 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:24:43,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:24:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:24:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 19:24:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:24:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 19:24:43,161 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-03 19:24:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:43,162 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 19:24:43,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:24:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 19:24:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:24:43,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:43,163 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:43,163 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash 954425671, now seen corresponding path program 5 times [2019-09-03 19:24:43,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:43,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:43,275 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) [2019-09-03 19:24:43,289 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:43,336 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:24:43,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:43,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:24:43,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:43,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:43,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:24:43,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:24:43,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:24:43,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:24:43,366 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-03 19:24:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:43,421 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 19:24:43,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:24:43,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-03 19:24:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:43,424 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:24:43,424 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:24:43,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:24:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:24:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 19:24:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:24:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 19:24:43,432 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-03 19:24:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:43,433 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 19:24:43,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:24:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 19:24:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:24:43,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:43,435 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:43,436 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:43,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:43,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1534314089, now seen corresponding path program 6 times [2019-09-03 19:24:43,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:43,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:43,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:43,530 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) [2019-09-03 19:24:43,550 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:43,597 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:24:43,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:43,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:24:43,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:24:43,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:43,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:24:43,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:24:43,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:24:43,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:24:43,629 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-03 19:24:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:43,688 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 19:24:43,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:24:43,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-03 19:24:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:43,692 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:24:43,692 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:24:43,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:24:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:24:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 19:24:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:24:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 19:24:43,701 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-03 19:24:43,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:43,703 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 19:24:43,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:24:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 19:24:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:24:43,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:43,704 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:43,704 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash 461335307, now seen corresponding path program 7 times [2019-09-03 19:24:43,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:43,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:43,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:43,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:43,844 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-03 19:24:43,866 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-03 19:24:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:43,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:24:43,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:43,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:43,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:24:43,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:24:43,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:24:43,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:24:43,926 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-09-03 19:24:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:43,969 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 19:24:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:24:43,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-03 19:24:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:43,971 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:24:43,971 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:24:43,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:24:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:24:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 19:24:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:24:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 19:24:43,977 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-03 19:24:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:43,977 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 19:24:43,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:24:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 19:24:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:24:43,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:43,978 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:43,979 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash 120876845, now seen corresponding path program 8 times [2019-09-03 19:24:43,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:43,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:44,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:44,089 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-03 19:24:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:44,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:44,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:44,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:24:44,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:44,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:44,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 19:24:44,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:24:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:24:44,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:24:44,177 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-09-03 19:24:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:44,236 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 19:24:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:24:44,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-03 19:24:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:44,238 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:24:44,239 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:24:44,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:24:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:24:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 19:24:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:24:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 19:24:44,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-03 19:24:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:44,247 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 19:24:44,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:24:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 19:24:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:24:44,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:44,252 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:44,252 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:44,253 INFO L82 PathProgramCache]: Analyzing trace with hash -642190641, now seen corresponding path program 9 times [2019-09-03 19:24:44,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:44,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:44,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:44,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:44,390 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) [2019-09-03 19:24:44,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:44,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:24:44,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:44,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:24:44,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:44,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:44,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 19:24:44,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:24:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:24:44,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:24:44,510 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2019-09-03 19:24:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:44,568 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 19:24:44,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:24:44,569 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-09-03 19:24:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:44,570 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:24:44,570 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:24:44,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:24:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:24:44,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 19:24:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:24:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 19:24:44,575 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-03 19:24:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:44,576 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 19:24:44,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:24:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 19:24:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:24:44,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:44,577 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:44,578 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 10 times [2019-09-03 19:24:44,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:44,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:44,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:44,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:44,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:44,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:44,737 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) [2019-09-03 19:24:44,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:44,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:44,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:44,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:24:44,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:44,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:44,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:24:44,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:24:44,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:24:44,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:24:44,830 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-09-03 19:24:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:44,899 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 19:24:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:24:44,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-09-03 19:24:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:44,905 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:24:44,905 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:24:44,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:24:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:24:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-03 19:24:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:24:44,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 19:24:44,913 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-03 19:24:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:44,914 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 19:24:44,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:24:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 19:24:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:24:44,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:44,917 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:44,920 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:44,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1285617811, now seen corresponding path program 11 times [2019-09-03 19:24:44,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:44,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:44,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:45,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:45,092 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) [2019-09-03 19:24:45,115 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:45,195 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:24:45,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:45,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:24:45,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:45,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:45,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 19:24:45,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:24:45,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:24:45,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:24:45,237 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2019-09-03 19:24:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:45,295 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 19:24:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:24:45,295 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-03 19:24:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:45,296 INFO L225 Difference]: With dead ends: 44 [2019-09-03 19:24:45,296 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:24:45,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:24:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:24:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 19:24:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:24:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 19:24:45,302 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-03 19:24:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:45,302 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 19:24:45,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:24:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 19:24:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:24:45,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:45,303 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:45,304 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1982380725, now seen corresponding path program 12 times [2019-09-03 19:24:45,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:45,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:45,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:45,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:45,463 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-03 19:24:45,478 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:45,660 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:24:45,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:45,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:24:45,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:45,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:45,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 19:24:45,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:24:45,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:24:45,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:24:45,698 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2019-09-03 19:24:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:45,754 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 19:24:45,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:24:45,755 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-09-03 19:24:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:45,756 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:24:45,756 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:24:45,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:24:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:24:45,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 19:24:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:24:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 19:24:45,761 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-03 19:24:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:45,762 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 19:24:45,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:24:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 19:24:45,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:24:45,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:45,763 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:45,764 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:45,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1556642903, now seen corresponding path program 13 times [2019-09-03 19:24:45,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:45,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:45,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:45,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:45,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:45,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:45,955 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-03 19:24:45,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:45,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:24:45,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:46,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:46,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:24:46,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:24:46,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:24:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:24:46,018 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2019-09-03 19:24:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:46,078 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 19:24:46,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:24:46,079 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-09-03 19:24:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:46,080 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:24:46,080 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:24:46,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:24:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:24:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 19:24:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:24:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 19:24:46,085 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-03 19:24:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:46,085 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 19:24:46,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:24:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 19:24:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:24:46,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:46,086 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:46,086 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash 444489081, now seen corresponding path program 14 times [2019-09-03 19:24:46,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:46,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:46,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:46,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:46,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:46,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:46,252 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:46,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:46,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:46,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:46,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:24:46,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:46,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:46,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 19:24:46,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:24:46,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:24:46,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:24:46,316 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2019-09-03 19:24:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:46,394 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 19:24:46,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:24:46,394 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-09-03 19:24:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:46,395 INFO L225 Difference]: With dead ends: 50 [2019-09-03 19:24:46,395 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:24:46,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:24:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:24:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 19:24:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:24:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 19:24:46,403 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-03 19:24:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:46,404 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 19:24:46,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:24:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 19:24:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:24:46,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:46,405 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:46,406 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1111522843, now seen corresponding path program 15 times [2019-09-03 19:24:46,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:46,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:46,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:46,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:46,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:46,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:46,589 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-03 19:24:46,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:24:46,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:24:46,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:46,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:24:46,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:46,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:46,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 19:24:46,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:24:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:24:46,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:24:46,925 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2019-09-03 19:24:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:46,998 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-03 19:24:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:24:46,998 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-09-03 19:24:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:46,999 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:24:46,999 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:24:47,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:24:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:24:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 19:24:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:24:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 19:24:47,004 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-03 19:24:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:47,004 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 19:24:47,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:24:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 19:24:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:24:47,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:47,005 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:47,005 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2114126275, now seen corresponding path program 16 times [2019-09-03 19:24:47,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:47,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:47,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:47,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:47,240 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:47,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:24:47,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:47,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:47,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:24:47,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:47,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:47,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:24:47,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:24:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:24:47,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:24:47,308 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2019-09-03 19:24:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:47,359 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-03 19:24:47,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:24:47,359 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-09-03 19:24:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:47,360 INFO L225 Difference]: With dead ends: 54 [2019-09-03 19:24:47,360 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:24:47,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:24:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:24:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-03 19:24:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:24:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 19:24:47,365 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-03 19:24:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:47,366 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 19:24:47,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:24:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 19:24:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:24:47,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:47,367 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:47,367 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:47,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:47,367 INFO L82 PathProgramCache]: Analyzing trace with hash -996540961, now seen corresponding path program 17 times [2019-09-03 19:24:47,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:47,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:47,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:47,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:47,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:47,568 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-03 19:24:47,594 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:47,820 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 19:24:47,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:47,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:24:47,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:47,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 19:24:47,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:24:47,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:24:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:24:47,848 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2019-09-03 19:24:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:47,909 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-03 19:24:47,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:24:47,910 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-09-03 19:24:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:47,911 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:24:47,911 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:24:47,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:24:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:24:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 19:24:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:24:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-03 19:24:47,915 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-03 19:24:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:47,916 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-03 19:24:47,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:24:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-03 19:24:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:24:47,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:47,917 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:47,917 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:47,917 INFO L82 PathProgramCache]: Analyzing trace with hash -738878207, now seen corresponding path program 18 times [2019-09-03 19:24:47,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:47,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:47,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:47,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:48,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:48,160 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-03 19:24:48,173 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:24:48,565 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:24:48,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:48,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:24:48,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:48,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:48,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 19:24:48,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:24:48,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:24:48,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:24:48,590 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2019-09-03 19:24:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:48,669 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-03 19:24:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:24:48,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-03 19:24:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:48,670 INFO L225 Difference]: With dead ends: 58 [2019-09-03 19:24:48,671 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 19:24:48,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:24:48,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 19:24:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 19:24:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:24:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-03 19:24:48,675 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-03 19:24:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:48,676 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-03 19:24:48,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:24:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-03 19:24:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:24:48,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:48,676 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:48,677 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:48,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2061892515, now seen corresponding path program 19 times [2019-09-03 19:24:48,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:48,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:48,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:48,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:48,939 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) [2019-09-03 19:24:48,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:48,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:24:48,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:49,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:49,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:24:49,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:24:49,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:24:49,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:24:49,018 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2019-09-03 19:24:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:49,089 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-03 19:24:49,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:24:49,089 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-09-03 19:24:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:49,090 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:24:49,090 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:24:49,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:24:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:24:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 19:24:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 19:24:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-03 19:24:49,095 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-03 19:24:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:49,096 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-03 19:24:49,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:24:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-03 19:24:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:24:49,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:49,097 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:49,097 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:49,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:49,097 INFO L82 PathProgramCache]: Analyzing trace with hash 658061765, now seen corresponding path program 20 times [2019-09-03 19:24:49,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:49,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:49,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:49,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:49,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:49,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:49,341 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-03 19:24:49,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:49,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:49,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:49,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:24:49,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:49,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:49,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 19:24:49,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:24:49,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:24:49,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:24:49,435 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2019-09-03 19:24:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:49,507 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-03 19:24:49,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:24:49,509 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2019-09-03 19:24:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:49,510 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:24:49,510 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:24:49,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:24:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:24:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 19:24:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:24:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-03 19:24:49,515 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-03 19:24:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:49,515 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-03 19:24:49,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:24:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-03 19:24:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:24:49,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:49,521 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:49,521 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash 196441959, now seen corresponding path program 21 times [2019-09-03 19:24:49,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:49,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:49,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:49,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:49,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:49,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:49,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:24:49,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:50,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 19:24:50,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:50,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:24:50,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:50,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:50,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-03 19:24:50,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:24:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:24:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:24:50,521 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2019-09-03 19:24:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:50,598 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-09-03 19:24:50,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:24:50,599 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-09-03 19:24:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:50,599 INFO L225 Difference]: With dead ends: 64 [2019-09-03 19:24:50,600 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:24:50,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:24:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:24:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 19:24:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:24:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-03 19:24:50,604 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-03 19:24:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:50,604 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-03 19:24:50,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:24:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-03 19:24:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:24:50,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:50,605 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:50,606 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:50,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1038560119, now seen corresponding path program 22 times [2019-09-03 19:24:50,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:50,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:50,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:50,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:24:50,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:50,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:50,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:24:50,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:50,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:50,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 19:24:50,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:24:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:24:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:24:50,962 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-09-03 19:24:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:51,047 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-09-03 19:24:51,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:24:51,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-03 19:24:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:51,050 INFO L225 Difference]: With dead ends: 66 [2019-09-03 19:24:51,051 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 19:24:51,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:24:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 19:24:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-03 19:24:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 19:24:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-03 19:24:51,055 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-03 19:24:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:51,056 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-03 19:24:51,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:24:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-03 19:24:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 19:24:51,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:51,057 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:51,057 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:51,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1830383915, now seen corresponding path program 23 times [2019-09-03 19:24:51,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:51,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:51,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:51,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:51,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:51,396 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:24:51,673 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-03 19:24:51,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:51,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:24:51,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:51,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:51,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 19:24:51,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:24:51,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:24:51,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:24:51,700 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2019-09-03 19:24:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:51,793 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-09-03 19:24:51,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:24:51,794 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-09-03 19:24:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:51,795 INFO L225 Difference]: With dead ends: 68 [2019-09-03 19:24:51,795 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 19:24:51,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:24:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 19:24:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-03 19:24:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 19:24:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-03 19:24:51,798 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-03 19:24:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:51,799 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-03 19:24:51,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:24:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-03 19:24:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 19:24:51,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:51,800 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:51,800 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:51,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1516596557, now seen corresponding path program 24 times [2019-09-03 19:24:51,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:51,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:51,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:52,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:52,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:24:52,176 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:55,216 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:24:55,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:55,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:24:55,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:55,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:55,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 19:24:55,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:24:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:24:55,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:24:55,245 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-09-03 19:24:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:55,338 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-09-03 19:24:55,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:24:55,338 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-09-03 19:24:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:55,339 INFO L225 Difference]: With dead ends: 70 [2019-09-03 19:24:55,339 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 19:24:55,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:24:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 19:24:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-03 19:24:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 19:24:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-03 19:24:55,344 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-03 19:24:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:55,344 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-03 19:24:55,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:24:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-03 19:24:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:24:55,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:55,345 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:55,345 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:55,346 INFO L82 PathProgramCache]: Analyzing trace with hash 614656239, now seen corresponding path program 25 times [2019-09-03 19:24:55,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:55,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:55,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:55,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:55,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:55,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:55,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:55,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:55,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:24:55,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:55,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:55,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 19:24:55,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:24:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:24:55,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:24:55,795 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2019-09-03 19:24:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:55,891 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-09-03 19:24:55,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:24:55,894 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-09-03 19:24:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:55,895 INFO L225 Difference]: With dead ends: 72 [2019-09-03 19:24:55,896 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 19:24:55,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:24:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 19:24:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-03 19:24:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 19:24:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-03 19:24:55,900 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-03 19:24:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:55,900 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-03 19:24:55,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:24:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-03 19:24:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:24:55,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:55,901 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:55,901 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1433404433, now seen corresponding path program 26 times [2019-09-03 19:24:55,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:55,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:55,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:55,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:55,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:56,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:56,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:56,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:56,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:56,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:56,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:24:56,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:56,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:56,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-03 19:24:56,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:24:56,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:24:56,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:24:56,354 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2019-09-03 19:24:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:56,453 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-09-03 19:24:56,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:24:56,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-03 19:24:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:56,455 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:24:56,455 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 19:24:56,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:24:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 19:24:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-03 19:24:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 19:24:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-03 19:24:56,459 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-03 19:24:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:56,459 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-03 19:24:56,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:24:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-03 19:24:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 19:24:56,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:56,460 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:56,460 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2023563597, now seen corresponding path program 27 times [2019-09-03 19:24:56,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:56,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:56,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:24:56,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:56,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:56,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:25:01,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 19:25:01,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:01,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:25:01,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:01,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:01,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-03 19:25:01,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:25:01,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:25:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:25:01,806 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2019-09-03 19:25:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:01,894 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-09-03 19:25:01,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:25:01,894 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-09-03 19:25:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:01,896 INFO L225 Difference]: With dead ends: 76 [2019-09-03 19:25:01,896 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 19:25:01,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:25:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 19:25:01,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-03 19:25:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 19:25:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-03 19:25:01,902 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-03 19:25:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:01,902 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-03 19:25:01,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:25:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-03 19:25:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:25:01,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:01,906 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:01,906 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:01,906 INFO L82 PathProgramCache]: Analyzing trace with hash 134846677, now seen corresponding path program 28 times [2019-09-03 19:25:01,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:01,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:01,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:02,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:02,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:02,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:25:02,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:25:02,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:02,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:25:02,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:02,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:02,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-03 19:25:02,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:25:02,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:25:02,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:25:02,374 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2019-09-03 19:25:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:02,480 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-09-03 19:25:02,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:25:02,480 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-09-03 19:25:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:02,481 INFO L225 Difference]: With dead ends: 78 [2019-09-03 19:25:02,482 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:25:02,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:25:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:25:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-03 19:25:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 19:25:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-03 19:25:02,486 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-03 19:25:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:02,487 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-03 19:25:02,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:25:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-03 19:25:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 19:25:02,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:02,488 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:02,488 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash -102083977, now seen corresponding path program 29 times [2019-09-03 19:25:02,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:02,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:02,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:02,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:02,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:02,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:02,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:25:02,990 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:03,542 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-03 19:25:03,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:03,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:25:03,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:03,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:03,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-03 19:25:03,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:25:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:25:03,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:25:03,569 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2019-09-03 19:25:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:03,668 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-09-03 19:25:03,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:25:03,668 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2019-09-03 19:25:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:03,669 INFO L225 Difference]: With dead ends: 80 [2019-09-03 19:25:03,670 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 19:25:03,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:25:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 19:25:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-03 19:25:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 19:25:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-03 19:25:03,675 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-03 19:25:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:03,675 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-03 19:25:03,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:25:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-03 19:25:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:25:03,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:03,676 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:03,676 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash -159175783, now seen corresponding path program 30 times [2019-09-03 19:25:03,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:03,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:03,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:04,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:04,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:25:04,265 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:10,356 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 19:25:10,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:10,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:25:10,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:10,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:10,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-03 19:25:10,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:25:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:25:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:25:10,390 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2019-09-03 19:25:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:10,505 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-09-03 19:25:10,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:25:10,505 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-03 19:25:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:10,506 INFO L225 Difference]: With dead ends: 82 [2019-09-03 19:25:10,506 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 19:25:10,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:25:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 19:25:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-03 19:25:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 19:25:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-03 19:25:10,510 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-03 19:25:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:10,511 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-03 19:25:10,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:25:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-03 19:25:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 19:25:10,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:10,512 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:10,512 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:10,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:10,512 INFO L82 PathProgramCache]: Analyzing trace with hash 810173499, now seen corresponding path program 31 times [2019-09-03 19:25:10,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:10,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:10,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:10,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:11,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:11,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:11,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:25:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:11,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:25:11,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:11,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:11,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-03 19:25:11,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:25:11,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:25:11,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:25:11,146 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2019-09-03 19:25:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:11,301 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-09-03 19:25:11,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:25:11,301 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2019-09-03 19:25:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:11,302 INFO L225 Difference]: With dead ends: 84 [2019-09-03 19:25:11,302 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 19:25:11,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:25:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 19:25:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-03 19:25:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 19:25:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-03 19:25:11,307 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-03 19:25:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:11,307 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-03 19:25:11,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:25:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-03 19:25:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 19:25:11,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:11,308 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:11,308 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash 346930269, now seen corresponding path program 32 times [2019-09-03 19:25:11,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:11,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:11,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:25:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:11,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:11,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:11,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:25:11,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:25:11,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:11,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:25:11,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:11,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:11,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-03 19:25:11,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:25:11,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:25:11,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:25:11,899 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2019-09-03 19:25:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:12,021 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-09-03 19:25:12,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:25:12,021 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2019-09-03 19:25:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:12,022 INFO L225 Difference]: With dead ends: 86 [2019-09-03 19:25:12,022 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:25:12,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:25:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:25:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 19:25:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:25:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-03 19:25:12,026 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-03 19:25:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:12,026 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-03 19:25:12,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:25:12,027 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-03 19:25:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 19:25:12,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:12,028 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:12,028 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:12,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1846785023, now seen corresponding path program 33 times [2019-09-03 19:25:12,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:12,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:12,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:12,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:12,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:12,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:25:33,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 19:25:33,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:33,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:25:33,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:33,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:33,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-03 19:25:33,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:25:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:25:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:25:33,630 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2019-09-03 19:25:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:33,749 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-09-03 19:25:33,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:25:33,754 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2019-09-03 19:25:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:33,754 INFO L225 Difference]: With dead ends: 88 [2019-09-03 19:25:33,755 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 19:25:33,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:25:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 19:25:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-03 19:25:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 19:25:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-03 19:25:33,758 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-03 19:25:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:33,759 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-03 19:25:33,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:25:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-03 19:25:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:25:33,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:33,760 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:33,760 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:33,760 INFO L82 PathProgramCache]: Analyzing trace with hash 98192161, now seen corresponding path program 34 times [2019-09-03 19:25:33,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:33,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:33,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:33,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:33,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:34,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:34,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:34,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:25:34,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:25:34,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:34,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:25:34,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:34,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:34,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-03 19:25:34,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:25:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:25:34,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:25:34,385 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2019-09-03 19:25:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:34,513 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-09-03 19:25:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:25:34,514 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-03 19:25:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:34,515 INFO L225 Difference]: With dead ends: 90 [2019-09-03 19:25:34,515 INFO L226 Difference]: Without dead ends: 84 [2019-09-03 19:25:34,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:25:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-03 19:25:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-03 19:25:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 19:25:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-03 19:25:34,519 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-03 19:25:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:34,519 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-03 19:25:34,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:25:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-03 19:25:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 19:25:34,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:34,520 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:34,520 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash -967335485, now seen corresponding path program 35 times [2019-09-03 19:25:34,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:34,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:34,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:35,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:35,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:35,092 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:25:36,100 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-03 19:25:36,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:36,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:25:36,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:36,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:36,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-03 19:25:36,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:25:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:25:36,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:25:36,130 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2019-09-03 19:25:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:36,277 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-09-03 19:25:36,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:25:36,278 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2019-09-03 19:25:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:36,279 INFO L225 Difference]: With dead ends: 92 [2019-09-03 19:25:36,279 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 19:25:36,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:25:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 19:25:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-03 19:25:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 19:25:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-03 19:25:36,283 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-03 19:25:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:36,283 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-03 19:25:36,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:25:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-03 19:25:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:25:36,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:36,284 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:36,285 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:36,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:36,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1557780453, now seen corresponding path program 36 times [2019-09-03 19:25:36,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:36,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:36,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:36,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:36,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:36,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:36,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:36,894 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:25:59,853 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 19:25:59,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:59,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:25:59,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:59,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:59,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-03 19:25:59,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:25:59,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:25:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:25:59,905 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2019-09-03 19:26:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:00,036 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-09-03 19:26:00,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:26:00,038 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2019-09-03 19:26:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:00,040 INFO L225 Difference]: With dead ends: 94 [2019-09-03 19:26:00,040 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 19:26:00,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:26:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 19:26:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-03 19:26:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 19:26:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-03 19:26:00,047 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-03 19:26:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:00,047 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-03 19:26:00,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:26:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-03 19:26:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:26:00,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:00,049 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:00,049 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1537674631, now seen corresponding path program 37 times [2019-09-03 19:26:00,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:00,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:00,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:26:00,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:00,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:00,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:00,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:26:00,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:26:00,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:00,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-03 19:26:00,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:26:00,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:26:00,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:26:00,850 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2019-09-03 19:26:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:01,002 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-09-03 19:26:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:26:01,003 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-09-03 19:26:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:01,004 INFO L225 Difference]: With dead ends: 96 [2019-09-03 19:26:01,004 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 19:26:01,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:26:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 19:26:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-03 19:26:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 19:26:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-03 19:26:01,008 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-03 19:26:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:01,009 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-03 19:26:01,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:26:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-03 19:26:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:26:01,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:01,010 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:01,010 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash -604151127, now seen corresponding path program 38 times [2019-09-03 19:26:01,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:01,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:01,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:26:01,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:01,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:01,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:26:01,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:26:01,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:01,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:26:01,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:26:01,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:01,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-03 19:26:01,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:26:01,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:26:01,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:26:01,711 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2019-09-03 19:26:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:01,864 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-09-03 19:26:01,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:26:01,869 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-03 19:26:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:01,870 INFO L225 Difference]: With dead ends: 98 [2019-09-03 19:26:01,871 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 19:26:01,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:26:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 19:26:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-03 19:26:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 19:26:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-03 19:26:01,875 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-03 19:26:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:01,875 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-03 19:26:01,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:26:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-03 19:26:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 19:26:01,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:01,877 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:01,877 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:01,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1609369781, now seen corresponding path program 39 times [2019-09-03 19:26:01,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:01,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:01,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:01,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:01,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:26:02,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:02,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:26:02,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:42,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-03 19:26:42,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:42,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:26:42,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:26:42,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:42,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-03 19:26:42,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:26:42,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:26:42,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:26:42,954 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2019-09-03 19:26:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:43,080 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-09-03 19:26:43,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:26:43,081 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2019-09-03 19:26:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:43,082 INFO L225 Difference]: With dead ends: 100 [2019-09-03 19:26:43,082 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 19:26:43,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:26:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 19:26:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-03 19:26:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 19:26:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-03 19:26:43,089 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-03 19:26:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:43,089 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-03 19:26:43,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:26:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-03 19:26:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:26:43,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:43,091 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:43,091 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:43,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1256854675, now seen corresponding path program 40 times [2019-09-03 19:26:43,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:43,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:43,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:43,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:43,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:26:44,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:44,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:26:44,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:44,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:26:44,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:44,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:26:44,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:26:44,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:44,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-03 19:26:44,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:26:44,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:26:44,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:26:44,199 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2019-09-03 19:26:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:44,352 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-09-03 19:26:44,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:26:44,359 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-09-03 19:26:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:44,360 INFO L225 Difference]: With dead ends: 102 [2019-09-03 19:26:44,360 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 19:26:44,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:26:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 19:26:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-03 19:26:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 19:26:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-03 19:26:44,367 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-03 19:26:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:44,368 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-03 19:26:44,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:26:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-03 19:26:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 19:26:44,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:44,369 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:44,369 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:44,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1792254193, now seen corresponding path program 41 times [2019-09-03 19:26:44,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:44,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:44,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:44,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:26:45,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:45,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:45,087 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:26:47,012 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-03 19:26:47,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:47,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:26:47,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:26:47,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:47,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-03 19:26:47,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:26:47,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:26:47,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:26:47,081 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2019-09-03 19:26:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:47,229 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-09-03 19:26:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:26:47,231 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2019-09-03 19:26:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:47,232 INFO L225 Difference]: With dead ends: 104 [2019-09-03 19:26:47,232 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 19:26:47,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:26:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 19:26:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-03 19:26:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 19:26:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-03 19:26:47,237 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-03 19:26:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:47,237 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-03 19:26:47,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:26:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-03 19:26:47,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:26:47,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:47,238 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:47,238 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:47,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:47,239 INFO L82 PathProgramCache]: Analyzing trace with hash -915115471, now seen corresponding path program 42 times [2019-09-03 19:26:47,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:47,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:47,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:47,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:26:48,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:48,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:48,281 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:28:23,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-03 19:28:23,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:23,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:28:23,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:23,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:23,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-03 19:28:23,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:28:23,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:28:23,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:28:23,309 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2019-09-03 19:28:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:23,482 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-09-03 19:28:23,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:28:23,484 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-03 19:28:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:23,484 INFO L225 Difference]: With dead ends: 106 [2019-09-03 19:28:23,485 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 19:28:23,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:28:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 19:28:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-03 19:28:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 19:28:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-03 19:28:23,488 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-03 19:28:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:23,488 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-03 19:28:23,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:28:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-03 19:28:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 19:28:23,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:23,489 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:23,489 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:23,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash 201606355, now seen corresponding path program 43 times [2019-09-03 19:28:23,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:23,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:23,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:23,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:23,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:24,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:24,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:24,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:24,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:28:24,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:24,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:24,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-03 19:28:24,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:28:24,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:28:24,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:28:24,388 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2019-09-03 19:28:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:24,572 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-09-03 19:28:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:28:24,572 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2019-09-03 19:28:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:24,573 INFO L225 Difference]: With dead ends: 108 [2019-09-03 19:28:24,573 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 19:28:24,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:28:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 19:28:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-03 19:28:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 19:28:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-03 19:28:24,578 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-03 19:28:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:24,578 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-03 19:28:24,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:28:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-03 19:28:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 19:28:24,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:24,579 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:24,579 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash -370542859, now seen corresponding path program 44 times [2019-09-03 19:28:24,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:24,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:24,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:24,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:24,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:25,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:25,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:25,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:28:25,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:28:25,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:25,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:28:25,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:25,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:25,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-03 19:28:25,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:28:25,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:28:25,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:28:25,581 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2019-09-03 19:28:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:25,759 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-09-03 19:28:25,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:28:25,759 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2019-09-03 19:28:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:25,760 INFO L225 Difference]: With dead ends: 110 [2019-09-03 19:28:25,761 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 19:28:25,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:28:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 19:28:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-03 19:28:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 19:28:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-03 19:28:25,765 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-03 19:28:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:25,766 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-03 19:28:25,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:28:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-03 19:28:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:28:25,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:25,767 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:25,767 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:25,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:25,768 INFO L82 PathProgramCache]: Analyzing trace with hash -450123625, now seen corresponding path program 45 times [2019-09-03 19:28:25,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:25,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:25,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:25,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:25,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:26,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:26,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:26,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:30:06,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-03 19:30:06,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:06,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:30:06,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:30:06,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:06,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-03 19:30:06,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:30:06,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:30:06,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:30:06,143 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2019-09-03 19:30:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:06,308 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-09-03 19:30:06,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:30:06,309 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2019-09-03 19:30:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:06,310 INFO L225 Difference]: With dead ends: 112 [2019-09-03 19:30:06,310 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 19:30:06,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:30:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 19:30:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-03 19:30:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 19:30:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-03 19:30:06,314 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-03 19:30:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:06,314 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-03 19:30:06,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:30:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-03 19:30:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:30:06,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:06,315 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:06,315 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash 382171577, now seen corresponding path program 46 times [2019-09-03 19:30:06,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:06,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:06,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:30:07,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:07,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:07,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:30:07,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:30:07,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:07,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:30:07,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:30:07,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:07,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-03 19:30:07,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:30:07,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:30:07,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:30:07,292 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2019-09-03 19:30:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:07,459 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-09-03 19:30:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:30:07,459 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-03 19:30:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:07,460 INFO L225 Difference]: With dead ends: 114 [2019-09-03 19:30:07,460 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 19:30:07,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:30:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 19:30:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-03 19:30:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 19:30:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-03 19:30:07,467 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-03 19:30:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:07,467 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-03 19:30:07,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:30:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-03 19:30:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 19:30:07,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:07,468 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:07,469 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:07,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1353943643, now seen corresponding path program 47 times [2019-09-03 19:30:07,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:07,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:07,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:07,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:07,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:30:08,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:08,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:08,406 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:30:10,868 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-03 19:30:10,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:10,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:30:10,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:30:10,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:10,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-03 19:30:10,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:30:10,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:30:10,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:30:10,908 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2019-09-03 19:30:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:11,074 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-09-03 19:30:11,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:30:11,074 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2019-09-03 19:30:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:11,075 INFO L225 Difference]: With dead ends: 116 [2019-09-03 19:30:11,075 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 19:30:11,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:30:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 19:30:11,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-03 19:30:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 19:30:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-03 19:30:11,079 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-03 19:30:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:11,080 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-03 19:30:11,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:30:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-03 19:30:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 19:30:11,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:11,081 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:11,081 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1075971459, now seen corresponding path program 48 times [2019-09-03 19:30:11,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:11,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:11,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:11,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:11,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:30:12,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:12,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:12,106 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:32:55,051 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-03 19:32:55,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:55,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:32:55,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:55,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:55,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-03 19:32:55,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:32:55,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:32:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:32:55,146 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2019-09-03 19:32:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:55,331 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-09-03 19:32:55,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:32:55,331 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2019-09-03 19:32:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:55,332 INFO L225 Difference]: With dead ends: 118 [2019-09-03 19:32:55,332 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 19:32:55,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:32:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 19:32:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-03 19:32:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 19:32:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-03 19:32:55,335 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-03 19:32:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:55,335 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-03 19:32:55,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:32:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-03 19:32:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:32:55,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:55,336 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:55,336 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:55,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:55,337 INFO L82 PathProgramCache]: Analyzing trace with hash 237824543, now seen corresponding path program 49 times [2019-09-03 19:32:55,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:55,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:55,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:56,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:56,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:56,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:32:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:56,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:32:56,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:32:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:56,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-03 19:32:56,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:32:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:32:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:32:56,403 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2019-09-03 19:32:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:56,593 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-09-03 19:32:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:32:56,593 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2019-09-03 19:32:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:56,595 INFO L225 Difference]: With dead ends: 120 [2019-09-03 19:32:56,595 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:32:56,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:32:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:32:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-03 19:32:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:32:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-03 19:32:56,600 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-03 19:32:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:56,600 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-03 19:32:56,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:32:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-03 19:32:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:32:56,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:56,603 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:56,604 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash 75397441, now seen corresponding path program 50 times [2019-09-03 19:32:56,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:56,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:56,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:32:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:57,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:57,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:57,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:32:58,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:32:58,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:58,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:32:58,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:58,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:58,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-03 19:32:58,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:32:58,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:32:58,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:32:58,109 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2019-09-03 19:32:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:58,285 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-09-03 19:32:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:32:58,286 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-03 19:32:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:58,287 INFO L225 Difference]: With dead ends: 122 [2019-09-03 19:32:58,287 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 19:32:58,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:32:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 19:32:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-03 19:32:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 19:32:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-03 19:32:58,292 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-03 19:32:58,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:58,293 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-03 19:32:58,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:32:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-03 19:32:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 19:32:58,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:58,294 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:58,294 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1398224925, now seen corresponding path program 51 times [2019-09-03 19:32:58,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:58,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:58,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:58,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:59,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:59,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:59,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:35:46,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-03 19:35:46,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:35:46,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:35:46,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:35:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:35:46,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:35:46,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-03 19:35:46,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:35:46,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:35:46,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:35:46,320 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2019-09-03 19:35:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:35:46,548 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-09-03 19:35:46,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:35:46,549 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2019-09-03 19:35:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:35:46,550 INFO L225 Difference]: With dead ends: 124 [2019-09-03 19:35:46,550 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:35:46,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:35:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:35:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-03 19:35:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 19:35:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-03 19:35:46,555 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-03 19:35:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:35:46,555 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-03 19:35:46,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:35:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-03 19:35:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 19:35:46,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:35:46,556 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:35:46,556 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:35:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:35:46,557 INFO L82 PathProgramCache]: Analyzing trace with hash -210110971, now seen corresponding path program 52 times [2019-09-03 19:35:46,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:35:46,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:35:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:46,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:35:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:35:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:35:47,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:35:47,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:35:47,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:35:47,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:35:47,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:35:47,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:35:47,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:35:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:35:47,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:35:47,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-03 19:35:47,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:35:47,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:35:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:35:47,788 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2019-09-03 19:35:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:35:47,994 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-09-03 19:35:47,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:35:47,997 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2019-09-03 19:35:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:35:47,998 INFO L225 Difference]: With dead ends: 126 [2019-09-03 19:35:47,998 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 19:35:47,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:35:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 19:35:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-03 19:35:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 19:35:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-03 19:35:48,002 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-03 19:35:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:35:48,002 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-03 19:35:48,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:35:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-03 19:35:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 19:35:48,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:35:48,003 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:35:48,004 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:35:48,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:35:48,004 INFO L82 PathProgramCache]: Analyzing trace with hash -893901913, now seen corresponding path program 53 times [2019-09-03 19:35:48,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:35:48,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:35:48,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:48,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:35:48,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:35:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:35:49,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:35:49,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:35:49,168 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:35:52,736 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-03 19:35:52,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:35:52,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:35:52,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:35:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:35:52,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:35:52,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-03 19:35:52,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:35:52,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:35:52,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:35:52,781 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2019-09-03 19:35:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:35:52,979 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-09-03 19:35:52,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:35:52,979 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-09-03 19:35:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:35:52,980 INFO L225 Difference]: With dead ends: 128 [2019-09-03 19:35:52,980 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 19:35:52,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:35:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 19:35:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-03 19:35:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 19:35:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-03 19:35:52,985 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-03 19:35:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:35:52,985 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-03 19:35:52,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:35:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-03 19:35:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:35:52,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:35:52,987 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:35:52,987 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:35:52,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:35:52,987 INFO L82 PathProgramCache]: Analyzing trace with hash -887000887, now seen corresponding path program 54 times [2019-09-03 19:35:52,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:35:52,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:35:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:52,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:35:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:35:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:35:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:35:54,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:35:54,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:35:54,277 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE