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_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:24:09,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:24:09,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:24:09,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:24:09,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:24:09,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:24:09,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:24:09,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:24:09,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:24:09,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:24:09,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:24:09,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:24:09,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:24:09,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:24:09,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:24:09,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:24:09,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:24:09,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:24:09,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:24:09,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:24:09,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:24:09,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:24:09,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:24:09,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:24:09,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:24:09,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:24:09,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:24:09,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:24:09,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:24:09,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:24:09,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:24:09,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:24:09,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:24:09,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:24:09,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:24:09,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:24:09,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:24:09,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:24:09,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:24:09,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:24:09,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:24:09,154 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:09,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:24:09,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:24:09,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:24:09,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:24:09,179 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:24:09,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:24:09,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:24:09,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:24:09,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:24:09,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:24:09,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:24:09,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:24:09,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:24:09,181 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:24:09,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:24:09,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:24:09,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:24:09,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:24:09,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:24:09,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:24:09,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:24:09,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:24:09,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:24:09,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:24:09,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:24:09,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:24:09,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:24:09,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:24:09,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:24:09,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:24:09,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:24:09,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:24:09,227 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:24:09,227 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:24:09,228 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_1-1.c [2019-09-03 19:24:09,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9272f39fd/4efa4a5974414ae6a611a99c0f0b42c0/FLAGa5111a8cb [2019-09-03 19:24:09,710 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:24:09,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-1.c [2019-09-03 19:24:09,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9272f39fd/4efa4a5974414ae6a611a99c0f0b42c0/FLAGa5111a8cb [2019-09-03 19:24:10,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9272f39fd/4efa4a5974414ae6a611a99c0f0b42c0 [2019-09-03 19:24:10,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:24:10,118 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:24:10,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:24:10,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:24:10,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:24:10,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:24:10" (1/1) ... [2019-09-03 19:24:10,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df7a19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:10, skipping insertion in model container [2019-09-03 19:24:10,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:24:10" (1/1) ... [2019-09-03 19:24:10,134 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:24:10,146 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:24:10,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:24:10,317 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:24:10,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:24:10,348 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:24:10,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:10 WrapperNode [2019-09-03 19:24:10,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:24:10,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:24:10,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:24:10,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:24:10,447 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:10" (1/1) ... [2019-09-03 19:24:10,447 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:10" (1/1) ... [2019-09-03 19:24:10,453 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:10" (1/1) ... [2019-09-03 19:24:10,453 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:10" (1/1) ... [2019-09-03 19:24:10,458 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:10" (1/1) ... [2019-09-03 19:24:10,462 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:10" (1/1) ... [2019-09-03 19:24:10,463 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:10" (1/1) ... [2019-09-03 19:24:10,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:24:10,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:24:10,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:24:10,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:24:10,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:10" (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:10,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:24:10,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:24:10,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:24:10,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:24:10,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:24:10,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:24:10,523 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:24:10,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:24:10,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:24:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:24:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:24:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:24:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:24:10,691 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:24:10,692 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:24:10,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:24:10 BoogieIcfgContainer [2019-09-03 19:24:10,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:24:10,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:24:10,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:24:10,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:24:10,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:24:10" (1/3) ... [2019-09-03 19:24:10,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7839dc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:24:10, skipping insertion in model container [2019-09-03 19:24:10,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:24:10" (2/3) ... [2019-09-03 19:24:10,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7839dc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:24:10, skipping insertion in model container [2019-09-03 19:24:10,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:24:10" (3/3) ... [2019-09-03 19:24:10,716 INFO L109 eAbstractionObserver]: Analyzing ICFG array_1-1.c [2019-09-03 19:24:10,734 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:24:10,745 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:24:10,764 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:24:10,805 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:24:10,806 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:24:10,806 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:24:10,806 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:24:10,806 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:24:10,807 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:24:10,807 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:24:10,807 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:24:10,807 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:24:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-03 19:24:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:24:10,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:10,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:10,834 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:10,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2019-09-03 19:24:10,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:10,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:10,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:10,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:10,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:10,958 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:10,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:24:10,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:24:10,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:24:10,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:24:10,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:24:10,974 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-03 19:24:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:10,991 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-03 19:24:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:24:10,993 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-09-03 19:24:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:10,999 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:24:10,999 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:24:11,002 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:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:24:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 19:24:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 19:24:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 19:24:11,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-03 19:24:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:11,035 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 19:24:11,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:24:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 19:24:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:24:11,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:11,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:11,037 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2019-09-03 19:24:11,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:11,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:11,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:11,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:11,106 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:11,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:24:11,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:24:11,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:24:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:24:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:24:11,110 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2019-09-03 19:24:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:11,129 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 19:24:11,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:24:11,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-03 19:24:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:11,130 INFO L225 Difference]: With dead ends: 22 [2019-09-03 19:24:11,130 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:24:11,131 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:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:24:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-03 19:24:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:24:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 19:24:11,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-03 19:24:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:11,137 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 19:24:11,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:24:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 19:24:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:24:11,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:11,138 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:11,138 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2019-09-03 19:24:11,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:11,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:11,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:11,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:11,188 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:11,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:11,189 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:11,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:11,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 19:24:11,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:11,279 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:11,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:11,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:24:11,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:24:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:24:11,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:24:11,287 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-03 19:24:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:11,326 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 19:24:11,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:24:11,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 19:24:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:11,328 INFO L225 Difference]: With dead ends: 24 [2019-09-03 19:24:11,328 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:24:11,329 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:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:24:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 19:24:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:24:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 19:24:11,334 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-03 19:24:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:11,334 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 19:24:11,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:24:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 19:24:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:24:11,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:11,335 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:11,335 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728289, now seen corresponding path program 2 times [2019-09-03 19:24:11,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:11,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:11,403 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:11,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:11,404 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:11,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:11,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:11,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:11,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:24:11,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:11,455 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:11,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:11,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:24:11,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:24:11,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:24:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:24:11,463 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-03 19:24:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:11,485 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 19:24:11,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:24:11,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-03 19:24:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:11,486 INFO L225 Difference]: With dead ends: 26 [2019-09-03 19:24:11,487 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:24:11,487 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:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:24:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-03 19:24:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:24:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 19:24:11,492 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-03 19:24:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:11,492 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 19:24:11,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:24:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 19:24:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:24:11,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:11,493 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:11,493 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:11,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash 676582787, now seen corresponding path program 3 times [2019-09-03 19:24:11,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:11,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:11,584 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:11,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:11,585 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:11,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:24:11,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:24:11,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:11,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:24:11,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:11,659 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:11,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:11,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:24:11,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:24:11,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:24:11,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:24:11,667 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-03 19:24:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:11,709 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 19:24:11,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:24:11,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-03 19:24:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:11,711 INFO L225 Difference]: With dead ends: 28 [2019-09-03 19:24:11,712 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:24:11,712 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:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:24:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 19:24:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:24:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 19:24:11,720 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-03 19:24:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:11,720 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 19:24:11,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:24:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 19:24:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:24:11,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:11,723 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:11,723 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:11,724 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 4 times [2019-09-03 19:24:11,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:11,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:11,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:11,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:11,805 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:11,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:11,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:11,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:24:11,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:11,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:11,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:24:11,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:11,878 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:11,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:11,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:24:11,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:24:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:24:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:24:11,885 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-03 19:24:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:11,931 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 19:24:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:24:11,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-03 19:24:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:11,933 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:24:11,933 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:24:11,937 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:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:24:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 19:24:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:24:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 19:24:11,947 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-03 19:24:11,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:11,948 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 19:24:11,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:24:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 19:24:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:24:11,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:11,949 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:11,949 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash 954425671, now seen corresponding path program 5 times [2019-09-03 19:24:11,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:11,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:11,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:11,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:12,077 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:12,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:12,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:12,092 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:24:12,128 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:24:12,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:12,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:24:12,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:12,161 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:12,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:12,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:24:12,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:24:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:24:12,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:24:12,168 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-03 19:24:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:12,206 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 19:24:12,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:24:12,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-03 19:24:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:12,208 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:24:12,208 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:24:12,209 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:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:24:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 19:24:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:24:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 19:24:12,213 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-03 19:24:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:12,214 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 19:24:12,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:24:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 19:24:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:24:12,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:12,215 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:12,215 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1534314089, now seen corresponding path program 6 times [2019-09-03 19:24:12,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:12,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:12,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:12,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:12,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:12,292 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:12,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:12,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:12,314 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:24:12,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:24:12,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:12,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:24:12,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:12,352 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): Broken pipe [2019-09-03 19:24:12,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:12,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:24:12,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:24:12,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:24:12,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:24:12,362 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-03 19:24:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:12,407 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 19:24:12,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:24:12,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-03 19:24:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:12,409 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:24:12,409 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:24:12,409 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:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:24:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 19:24:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:24:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 19:24:12,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-03 19:24:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:12,414 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 19:24:12,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:24:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 19:24:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:24:12,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:12,416 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:12,416 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash 461335307, now seen corresponding path program 7 times [2019-09-03 19:24:12,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:12,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:12,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:12,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:12,514 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:12,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:12,514 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:12,528 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:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:12,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:24:12,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:12,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:12,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:24:12,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:24:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:24:12,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:24:12,573 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-09-03 19:24:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:12,608 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 19:24:12,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:24:12,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-03 19:24:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:12,610 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:24:12,610 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:24:12,611 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:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:24:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 19:24:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:24:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 19:24:12,615 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-03 19:24:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:12,615 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 19:24:12,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:24:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 19:24:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:24:12,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:12,617 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:12,617 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash 120876845, now seen corresponding path program 8 times [2019-09-03 19:24:12,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:12,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:12,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:12,740 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:12,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:12,741 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:12,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:12,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:12,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:12,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:24:12,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:12,811 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:12,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:12,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 19:24:12,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:24:12,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:24:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:24:12,824 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-09-03 19:24:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:12,878 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 19:24:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:24:12,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-03 19:24:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:12,879 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:24:12,880 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:24:12,880 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:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:24:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 19:24:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:24:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 19:24:12,887 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-03 19:24:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:12,892 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 19:24:12,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:24:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 19:24:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:24:12,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:12,893 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:12,893 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash -642190641, now seen corresponding path program 9 times [2019-09-03 19:24:12,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:12,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:12,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:13,038 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:13,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:13,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:13,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:24:13,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:24:13,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:13,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:24:13,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:13,135 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:13,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:13,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 19:24:13,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:24:13,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:24:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:24:13,148 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2019-09-03 19:24:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:13,207 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 19:24:13,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:24:13,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-09-03 19:24:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:13,209 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:24:13,209 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:24:13,209 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:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:24:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 19:24:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:24:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 19:24:13,214 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-03 19:24:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:13,214 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 19:24:13,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:24:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 19:24:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:24:13,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:13,215 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:13,216 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 10 times [2019-09-03 19:24:13,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:13,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:13,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:13,340 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:13,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:13,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:24:13,354 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:13,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:13,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:13,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:24:13,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:13,401 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:13,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:13,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:24:13,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:24:13,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:24:13,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:24:13,406 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-09-03 19:24:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:13,446 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 19:24:13,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:24:13,449 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-09-03 19:24:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:13,450 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:24:13,450 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:24:13,451 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:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:24:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-03 19:24:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:24:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 19:24:13,456 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-03 19:24:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:13,456 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 19:24:13,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:24:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 19:24:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:24:13,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:13,458 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:13,459 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:13,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1285617811, now seen corresponding path program 11 times [2019-09-03 19:24:13,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:13,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:13,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:13,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:13,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:13,618 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:13,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:13,619 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:13,637 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:13,720 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:24:13,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:13,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:24:13,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:13,752 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:13,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:13,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 19:24:13,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:24:13,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:24:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:24:13,764 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2019-09-03 19:24:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:13,809 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 19:24:13,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:24:13,809 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-03 19:24:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:13,810 INFO L225 Difference]: With dead ends: 44 [2019-09-03 19:24:13,810 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:24:13,811 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:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:24:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 19:24:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:24:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 19:24:13,815 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-03 19:24:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:13,816 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 19:24:13,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:24:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 19:24:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:24:13,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:13,817 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:13,817 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1982380725, now seen corresponding path program 12 times [2019-09-03 19:24:13,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:13,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:13,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:13,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:13,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:13,954 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:13,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:13,954 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:13,974 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:24:14,137 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:24:14,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:14,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:24:14,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:14,172 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:14,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:14,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 19:24:14,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:24:14,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:24:14,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:24:14,184 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2019-09-03 19:24:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:14,234 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 19:24:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:24:14,235 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-09-03 19:24:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:14,235 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:24:14,235 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:24:14,236 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:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:24:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 19:24:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:24:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 19:24:14,246 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-03 19:24:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:14,247 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 19:24:14,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:24:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 19:24:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:24:14,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:14,250 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:14,250 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1556642903, now seen corresponding path program 13 times [2019-09-03 19:24:14,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:14,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:14,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:14,418 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:14,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:14,418 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:14,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:24:14,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:14,477 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:14,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:14,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:24:14,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:24:14,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:24:14,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:24:14,488 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2019-09-03 19:24:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:14,545 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 19:24:14,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:24:14,547 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-09-03 19:24:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:14,548 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:24:14,548 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:24:14,549 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:14,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:24:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 19:24:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:24:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 19:24:14,554 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-03 19:24:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:14,554 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 19:24:14,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:24:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 19:24:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:24:14,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:14,555 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:14,556 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:14,556 INFO L82 PathProgramCache]: Analyzing trace with hash 444489081, now seen corresponding path program 14 times [2019-09-03 19:24:14,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:14,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:14,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:14,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:14,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:14,702 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:14,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:14,703 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:14,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:14,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:14,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:14,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:24:14,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:14,775 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:14,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:14,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 19:24:14,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:24:14,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:24:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:24:14,786 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2019-09-03 19:24:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:14,857 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 19:24:14,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:24:14,858 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-09-03 19:24:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:14,859 INFO L225 Difference]: With dead ends: 50 [2019-09-03 19:24:14,859 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:24:14,859 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:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:24:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 19:24:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:24:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 19:24:14,864 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-03 19:24:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:14,864 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 19:24:14,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:24:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 19:24:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:24:14,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:14,865 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:14,865 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:14,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1111522843, now seen corresponding path program 15 times [2019-09-03 19:24:14,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:14,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:14,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:14,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:14,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:15,018 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:15,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:15,019 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:15,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:24:15,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:24:15,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:15,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:24:15,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:15,261 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:15,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:15,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 19:24:15,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:24:15,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:24:15,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:24:15,266 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2019-09-03 19:24:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:15,320 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-03 19:24:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:24:15,320 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-09-03 19:24:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:15,321 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:24:15,321 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:24:15,322 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:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:24:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 19:24:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:24:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 19:24:15,326 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-03 19:24:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:15,327 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 19:24:15,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:24:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 19:24:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:24:15,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:15,328 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:15,328 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2114126275, now seen corresponding path program 16 times [2019-09-03 19:24:15,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:15,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:15,521 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:15,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:15,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:24:15,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:15,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:15,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:15,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:24:15,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:15,581 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:15,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:15,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:24:15,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:24:15,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:24:15,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:24:15,592 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2019-09-03 19:24:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:15,640 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-03 19:24:15,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:24:15,641 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-09-03 19:24:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:15,642 INFO L225 Difference]: With dead ends: 54 [2019-09-03 19:24:15,642 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:24:15,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:24:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:24:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-03 19:24:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:24:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 19:24:15,647 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-03 19:24:15,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:15,647 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 19:24:15,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:24:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 19:24:15,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:24:15,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:15,649 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:15,649 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:15,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:15,649 INFO L82 PathProgramCache]: Analyzing trace with hash -996540961, now seen corresponding path program 17 times [2019-09-03 19:24:15,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:15,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:15,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:15,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:15,815 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:15,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:15,816 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:15,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:24:15,941 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 19:24:15,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:15,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:24:15,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:15,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:15,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 19:24:15,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:24:15,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:24:15,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:24:15,978 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2019-09-03 19:24:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:16,031 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-03 19:24:16,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:24:16,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-09-03 19:24:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:16,031 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:24:16,032 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:24:16,032 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:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:24:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 19:24:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:24:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-03 19:24:16,036 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-03 19:24:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:16,037 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-03 19:24:16,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:24:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-03 19:24:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:24:16,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:16,038 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:16,038 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:16,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:16,039 INFO L82 PathProgramCache]: Analyzing trace with hash -738878207, now seen corresponding path program 18 times [2019-09-03 19:24:16,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:16,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:16,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:16,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:16,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:16,262 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:16,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:16,262 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:16,278 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:24:16,697 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:24:16,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:16,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:24:16,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:16,713 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:16,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:16,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 19:24:16,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:24:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:24:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:24:16,718 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2019-09-03 19:24:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:16,775 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-03 19:24:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:24:16,776 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-03 19:24:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:16,777 INFO L225 Difference]: With dead ends: 58 [2019-09-03 19:24:16,777 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 19:24:16,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:24:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 19:24:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 19:24:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:24:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-03 19:24:16,782 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-03 19:24:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:16,782 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-03 19:24:16,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:24:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-03 19:24:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:24:16,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:16,784 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:16,784 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2061892515, now seen corresponding path program 19 times [2019-09-03 19:24:16,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:16,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:16,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:17,048 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:17,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:17,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:17,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:17,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:24:17,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:17,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:17,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:24:17,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:24:17,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:24:17,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:24:17,106 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2019-09-03 19:24:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:17,167 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-03 19:24:17,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:24:17,168 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-09-03 19:24:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:17,169 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:24:17,169 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:24:17,169 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:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:24:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 19:24:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 19:24:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-03 19:24:17,173 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-03 19:24:17,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:17,174 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-03 19:24:17,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:24:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-03 19:24:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:24:17,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:17,175 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:17,175 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:17,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:17,175 INFO L82 PathProgramCache]: Analyzing trace with hash 658061765, now seen corresponding path program 20 times [2019-09-03 19:24:17,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:17,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:17,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:17,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:17,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:17,384 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:17,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:17,384 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:17,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:17,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:17,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:17,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:24:17,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:17,437 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:17,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:17,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 19:24:17,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:24:17,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:24:17,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:24:17,447 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2019-09-03 19:24:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:17,506 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-03 19:24:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:24:17,508 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2019-09-03 19:24:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:17,509 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:24:17,509 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:24:17,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:24:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:24:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 19:24:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:24:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-03 19:24:17,513 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-03 19:24:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:17,514 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-03 19:24:17,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:24:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-03 19:24:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:24:17,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:17,515 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:17,515 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:17,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:17,515 INFO L82 PathProgramCache]: Analyzing trace with hash 196441959, now seen corresponding path program 21 times [2019-09-03 19:24:17,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:17,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:17,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:17,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:17,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:17,758 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:17,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:17,759 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) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:17,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:24:18,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 19:24:18,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:18,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:24:18,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:18,243 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:18,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:18,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-03 19:24:18,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:24:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:24:18,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:24:18,249 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2019-09-03 19:24:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:18,311 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-09-03 19:24:18,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:24:18,311 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-09-03 19:24:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:18,312 INFO L225 Difference]: With dead ends: 64 [2019-09-03 19:24:18,312 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:24:18,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:24:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:24:18,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 19:24:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:24:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-03 19:24:18,317 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-03 19:24:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:18,322 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-03 19:24:18,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:24:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-03 19:24:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:24:18,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:18,324 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:18,324 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:18,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1038560119, now seen corresponding path program 22 times [2019-09-03 19:24:18,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:18,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:18,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:18,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:18,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:18,640 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:18,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:18,640 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:18,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:24:18,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:18,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:18,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:24:18,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:18,717 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:18,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:18,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 19:24:18,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:24:18,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:24:18,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:24:18,721 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-09-03 19:24:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:18,806 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-09-03 19:24:18,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:24:18,807 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-03 19:24:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:18,808 INFO L225 Difference]: With dead ends: 66 [2019-09-03 19:24:18,808 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 19:24:18,808 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:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 19:24:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-03 19:24:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 19:24:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-03 19:24:18,813 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-03 19:24:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:18,813 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-03 19:24:18,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:24:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-03 19:24:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 19:24:18,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:18,814 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:18,814 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:18,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1830383915, now seen corresponding path program 23 times [2019-09-03 19:24:18,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:18,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:18,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:18,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:18,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:19,123 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:19,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:19,124 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) [2019-09-03 19:24:19,142 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:19,445 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-03 19:24:19,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:19,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:24:19,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:19,465 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:19,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:19,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 19:24:19,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:24:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:24:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:24:19,471 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2019-09-03 19:24:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:19,546 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-09-03 19:24:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:24:19,546 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-09-03 19:24:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:19,547 INFO L225 Difference]: With dead ends: 68 [2019-09-03 19:24:19,547 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 19:24:19,548 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:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 19:24:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-03 19:24:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 19:24:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-03 19:24:19,550 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-03 19:24:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:19,551 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-03 19:24:19,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:24:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-03 19:24:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 19:24:19,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:19,552 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:19,552 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1516596557, now seen corresponding path program 24 times [2019-09-03 19:24:19,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:19,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:19,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:19,893 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:19,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:19,893 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) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:19,903 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:24:21,790 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:24:21,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:21,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:24:21,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:21,812 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:21,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:21,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 19:24:21,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:24:21,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:24:21,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:24:21,819 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-09-03 19:24:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:21,909 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-09-03 19:24:21,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:24:21,910 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-09-03 19:24:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:21,910 INFO L225 Difference]: With dead ends: 70 [2019-09-03 19:24:21,910 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 19:24:21,911 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:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 19:24:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-03 19:24:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 19:24:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-03 19:24:21,913 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-03 19:24:21,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:21,913 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-03 19:24:21,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:24:21,914 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-03 19:24:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:24:21,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:21,914 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:21,914 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:21,915 INFO L82 PathProgramCache]: Analyzing trace with hash 614656239, now seen corresponding path program 25 times [2019-09-03 19:24:21,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:21,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:21,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:21,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:21,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:22,265 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:22,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:22,266 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:22,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:22,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:24:22,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:22,344 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:22,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:22,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 19:24:22,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:24:22,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:24:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:24:22,349 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2019-09-03 19:24:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:22,441 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-09-03 19:24:22,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:24:22,442 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-09-03 19:24:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:22,443 INFO L225 Difference]: With dead ends: 72 [2019-09-03 19:24:22,443 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 19:24:22,443 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:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 19:24:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-03 19:24:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 19:24:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-03 19:24:22,446 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-03 19:24:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:22,447 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-03 19:24:22,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:24:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-03 19:24:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:24:22,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:22,448 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:22,448 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1433404433, now seen corresponding path program 26 times [2019-09-03 19:24:22,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:22,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:22,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:22,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:22,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:22,786 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:22,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:22,786 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:22,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:22,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:22,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:22,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:24:22,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:22,854 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:22,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:22,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-03 19:24:22,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:24:22,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:24:22,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:24:22,859 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2019-09-03 19:24:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:22,942 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-09-03 19:24:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:24:22,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-03 19:24:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:22,943 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:24:22,944 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 19:24:22,944 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:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 19:24:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-03 19:24:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 19:24:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-03 19:24:22,947 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-03 19:24:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:22,948 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-03 19:24:22,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:24:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-03 19:24:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 19:24:22,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:22,949 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:22,949 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:22,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:22,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2023563597, now seen corresponding path program 27 times [2019-09-03 19:24:22,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:22,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:22,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:22,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:22,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:23,351 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:23,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:23,351 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) [2019-09-03 19:24:23,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:24,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 19:24:24,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:24,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:24:24,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:24,034 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:24,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:24,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-03 19:24:24,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:24:24,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:24:24,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:24:24,039 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2019-09-03 19:24:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:24,127 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-09-03 19:24:24,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:24:24,127 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-09-03 19:24:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:24,128 INFO L225 Difference]: With dead ends: 76 [2019-09-03 19:24:24,128 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 19:24:24,129 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:24:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 19:24:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-03 19:24:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 19:24:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-03 19:24:24,132 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-03 19:24:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:24,133 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-03 19:24:24,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:24:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-03 19:24:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:24:24,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:24,134 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:24,134 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash 134846677, now seen corresponding path program 28 times [2019-09-03 19:24:24,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:24,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:24,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:24,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:24,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:24,527 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:24:24,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:24,528 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:24:24,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:24:24,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:24,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:24,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:24:24,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:24,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:24,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-03 19:24:24,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:24:24,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:24:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:24:24,609 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2019-09-03 19:24:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:24,716 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-09-03 19:24:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:24:24,716 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-09-03 19:24:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:24,717 INFO L225 Difference]: With dead ends: 78 [2019-09-03 19:24:24,717 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:24:24,718 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:24:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:24:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-03 19:24:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 19:24:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-03 19:24:24,723 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-03 19:24:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:24,723 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-03 19:24:24,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:24:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-03 19:24:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 19:24:24,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:24,724 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:24,725 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash -102083977, now seen corresponding path program 29 times [2019-09-03 19:24:24,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:24,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:24,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:24,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:24,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:25,134 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:24:25,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:25,135 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:24:25,153 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:24:25,643 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-03 19:24:25,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:25,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:24:25,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:25,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:25,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-03 19:24:25,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:24:25,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:24:25,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:24:25,678 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2019-09-03 19:24:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:25,773 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-09-03 19:24:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:24:25,773 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2019-09-03 19:24:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:25,774 INFO L225 Difference]: With dead ends: 80 [2019-09-03 19:24:25,774 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 19:24:25,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:24:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 19:24:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-03 19:24:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 19:24:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-03 19:24:25,778 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-03 19:24:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:25,778 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-03 19:24:25,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:24:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-03 19:24:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:24:25,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:25,779 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:25,779 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash -159175783, now seen corresponding path program 30 times [2019-09-03 19:24:25,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:25,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:25,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:26,173 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:24:26,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:26,174 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) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:26,192 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:24:35,061 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 19:24:35,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:35,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:24:35,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:35,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:35,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-03 19:24:35,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:24:35,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:24:35,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:24:35,122 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2019-09-03 19:24:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:35,222 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-09-03 19:24:35,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:24:35,223 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-03 19:24:35,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:35,224 INFO L225 Difference]: With dead ends: 82 [2019-09-03 19:24:35,224 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 19:24:35,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:24:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 19:24:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-03 19:24:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 19:24:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-03 19:24:35,229 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-03 19:24:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:35,229 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-03 19:24:35,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:24:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-03 19:24:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 19:24:35,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:35,230 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:35,230 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:35,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:35,231 INFO L82 PathProgramCache]: Analyzing trace with hash 810173499, now seen corresponding path program 31 times [2019-09-03 19:24:35,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:35,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:35,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:35,812 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:24:35,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:35,813 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:24:35,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:35,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:24:35,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:35,878 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:24:35,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:35,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-03 19:24:35,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:24:35,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:24:35,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:24:35,882 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2019-09-03 19:24:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:35,964 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-09-03 19:24:35,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:24:35,964 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2019-09-03 19:24:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:35,964 INFO L225 Difference]: With dead ends: 84 [2019-09-03 19:24:35,965 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 19:24:35,965 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:24:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 19:24:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-03 19:24:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 19:24:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-03 19:24:35,968 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-03 19:24:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:35,968 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-03 19:24:35,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:24:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-03 19:24:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 19:24:35,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:35,969 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:35,969 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:35,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:35,969 INFO L82 PathProgramCache]: Analyzing trace with hash 346930269, now seen corresponding path program 32 times [2019-09-03 19:24:35,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:35,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:35,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:35,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:35,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:36,482 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:24:36,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:36,482 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:24:36,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:24:36,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:24:36,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:36,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:24:36,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:36,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:36,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-03 19:24:36,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:24:36,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:24:36,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:24:36,553 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2019-09-03 19:24:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:36,650 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-09-03 19:24:36,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:24:36,650 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2019-09-03 19:24:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:36,651 INFO L225 Difference]: With dead ends: 86 [2019-09-03 19:24:36,651 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:24:36,652 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:24:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:24:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 19:24:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:24:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-03 19:24:36,656 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-03 19:24:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:36,656 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-03 19:24:36,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:24:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-03 19:24:36,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 19:24:36,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:36,657 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:36,657 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:36,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1846785023, now seen corresponding path program 33 times [2019-09-03 19:24:36,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:36,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:36,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:36,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:36,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:37,124 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:24:37,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:37,124 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:24:37,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:24:42,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 19:24:42,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:42,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:24:42,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:42,967 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:24:42,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:42,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-03 19:24:42,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:24:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:24:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:24:42,975 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2019-09-03 19:24:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:43,087 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-09-03 19:24:43,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:24:43,087 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2019-09-03 19:24:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:43,088 INFO L225 Difference]: With dead ends: 88 [2019-09-03 19:24:43,088 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 19:24:43,090 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:24:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 19:24:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-03 19:24:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 19:24:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-03 19:24:43,094 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-03 19:24:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:43,094 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-03 19:24:43,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:24:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-03 19:24:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:24:43,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:43,095 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:43,096 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:43,096 INFO L82 PathProgramCache]: Analyzing trace with hash 98192161, now seen corresponding path program 34 times [2019-09-03 19:24:43,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:43,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:43,618 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:24:43,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:43,619 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:24:43,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:24:43,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:24:43,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:43,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:24:43,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:43,680 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:24:43,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:43,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-03 19:24:43,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:24:43,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:24:43,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:24:43,685 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2019-09-03 19:24:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:43,791 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-09-03 19:24:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:24:43,792 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-03 19:24:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:43,793 INFO L225 Difference]: With dead ends: 90 [2019-09-03 19:24:43,794 INFO L226 Difference]: Without dead ends: 84 [2019-09-03 19:24:43,795 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:24:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-03 19:24:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-03 19:24:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 19:24:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-03 19:24:43,798 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-03 19:24:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:43,798 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-03 19:24:43,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:24:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-03 19:24:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 19:24:43,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:43,799 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:43,799 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash -967335485, now seen corresponding path program 35 times [2019-09-03 19:24:43,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:43,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:44,363 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:24:44,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:44,364 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:24:44,374 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:24:45,137 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-03 19:24:45,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:45,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:24:45,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:45,159 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:24:45,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:45,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-03 19:24:45,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:24:45,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:24:45,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:24:45,166 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2019-09-03 19:24:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:45,294 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-09-03 19:24:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:24:45,295 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2019-09-03 19:24:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:45,296 INFO L225 Difference]: With dead ends: 92 [2019-09-03 19:24:45,296 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 19:24:45,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:24:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 19:24:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-03 19:24:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 19:24:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-03 19:24:45,300 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-03 19:24:45,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:45,301 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-03 19:24:45,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:24:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-03 19:24:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:24:45,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:45,302 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:45,302 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:45,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1557780453, now seen corresponding path program 36 times [2019-09-03 19:24:45,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:45,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:45,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:45,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:45,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:46,074 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:24:46,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:46,075 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) [2019-09-03 19:24:46,094 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:58,897 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 19:24:58,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:58,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:24:58,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:58,929 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:24:58,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:58,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-03 19:24:58,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:24:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:24:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:24:58,940 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2019-09-03 19:24:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:59,050 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-09-03 19:24:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:24:59,051 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2019-09-03 19:24:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:59,052 INFO L225 Difference]: With dead ends: 94 [2019-09-03 19:24:59,052 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 19:24:59,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:24:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 19:24:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-03 19:24:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 19:24:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-03 19:24:59,057 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-03 19:24:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:59,057 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-03 19:24:59,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:24:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-03 19:24:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:24:59,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:59,058 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:59,059 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1537674631, now seen corresponding path program 37 times [2019-09-03 19:24:59,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:59,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:59,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:59,691 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:24:59,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:59,692 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:24:59,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:59,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:24:59,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:59,750 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:24:59,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:59,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-03 19:24:59,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:24:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:24:59,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:24:59,754 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2019-09-03 19:24:59,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:59,886 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-09-03 19:24:59,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:24:59,887 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-09-03 19:24:59,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:59,888 INFO L225 Difference]: With dead ends: 96 [2019-09-03 19:24:59,888 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 19:24:59,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:24:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 19:24:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-03 19:24:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 19:24:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-03 19:24:59,892 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-03 19:24:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:59,892 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-03 19:24:59,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:24:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-03 19:24:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:24:59,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:59,893 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:59,893 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:59,893 INFO L82 PathProgramCache]: Analyzing trace with hash -604151127, now seen corresponding path program 38 times [2019-09-03 19:24:59,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:59,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:59,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:59,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:59,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:00,514 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:25:00,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:00,514 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:25:00,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:25:00,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:25:00,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:00,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:25:00,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:00,575 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:25:00,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:00,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-03 19:25:00,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:25:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:25:00,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:25:00,580 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2019-09-03 19:25:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:00,707 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-09-03 19:25:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:25:00,708 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-03 19:25:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:00,709 INFO L225 Difference]: With dead ends: 98 [2019-09-03 19:25:00,709 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 19:25:00,710 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:25:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 19:25:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-03 19:25:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 19:25:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-03 19:25:00,715 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-03 19:25:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:00,715 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-03 19:25:00,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:25:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-03 19:25:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 19:25:00,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:00,716 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:00,716 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1609369781, now seen corresponding path program 39 times [2019-09-03 19:25:00,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:00,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:00,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:01,340 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:25:01,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:01,340 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) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:01,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:25:10,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-03 19:25:10,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:10,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:25:10,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:10,867 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:25:10,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:10,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-03 19:25:10,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:25:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:25:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:25:10,875 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2019-09-03 19:25:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:10,966 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-09-03 19:25:10,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:25:10,967 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2019-09-03 19:25:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:10,968 INFO L225 Difference]: With dead ends: 100 [2019-09-03 19:25:10,968 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 19:25:10,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:25:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 19:25:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-03 19:25:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 19:25:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-03 19:25:10,973 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-03 19:25:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:10,974 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-03 19:25:10,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:25:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-03 19:25:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:25:10,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:10,975 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:10,975 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1256854675, now seen corresponding path program 40 times [2019-09-03 19:25:10,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:10,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:10,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:11,674 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:25:11,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:11,674 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) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:25:11,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:25:11,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:25:11,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:11,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:25:11,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:25:11,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:11,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-03 19:25:11,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:25:11,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:25:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:25:11,756 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2019-09-03 19:25:11,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:11,876 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-09-03 19:25:11,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:25:11,876 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-09-03 19:25:11,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:11,877 INFO L225 Difference]: With dead ends: 102 [2019-09-03 19:25:11,877 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 19:25:11,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:25:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 19:25:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-03 19:25:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 19:25:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-03 19:25:11,883 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-03 19:25:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:11,883 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-03 19:25:11,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:25:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-03 19:25:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 19:25:11,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:11,884 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:11,884 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1792254193, now seen corresponding path program 41 times [2019-09-03 19:25:11,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:11,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:12,901 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:25:12,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:12,901 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:25:12,914 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:25:20,472 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-03 19:25:20,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:25:20,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:25:20,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:25:20,499 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:25:20,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:20,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-03 19:25:20,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:25:20,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:25:20,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:25:20,509 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2019-09-03 19:25:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:25:20,631 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-09-03 19:25:20,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:25:20,633 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2019-09-03 19:25:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:25:20,634 INFO L225 Difference]: With dead ends: 104 [2019-09-03 19:25:20,634 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 19:25:20,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:25:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 19:25:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-03 19:25:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 19:25:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-03 19:25:20,639 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-03 19:25:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:25:20,639 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-03 19:25:20,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:25:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-03 19:25:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:25:20,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:25:20,640 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:25:20,641 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:25:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:25:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -915115471, now seen corresponding path program 42 times [2019-09-03 19:25:20,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:25:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:25:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:20,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:25:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:25:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:25:21,400 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:25:21,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:25:21,400 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:25:21,411 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:26:00,758 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-03 19:26:00,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:00,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:26:00,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:00,800 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:00,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:00,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-03 19:26:00,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:26:00,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:26:00,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:26:00,811 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2019-09-03 19:26:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:00,962 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-09-03 19:26:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:26:00,967 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-03 19:26:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:00,968 INFO L225 Difference]: With dead ends: 106 [2019-09-03 19:26:00,968 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 19:26:00,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:26:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 19:26:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-03 19:26:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 19:26:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-03 19:26:00,972 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-03 19:26:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:00,973 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-03 19:26:00,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:26:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-03 19:26:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 19:26:00,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:00,974 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:00,974 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:00,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 201606355, now seen corresponding path program 43 times [2019-09-03 19:26:00,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:00,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:00,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:00,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:00,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:01,728 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:26:01,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:01,728 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:26:01,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:01,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:26:01,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:01,817 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:26:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:01,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-03 19:26:01,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:26:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:26:01,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:26:01,822 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2019-09-03 19:26:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:01,958 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-09-03 19:26:01,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:26:01,959 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2019-09-03 19:26:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:01,960 INFO L225 Difference]: With dead ends: 108 [2019-09-03 19:26:01,960 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 19:26:01,960 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:26:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 19:26:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-03 19:26:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 19:26:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-03 19:26:01,964 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-03 19:26:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:01,964 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-03 19:26:01,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:26:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-03 19:26:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 19:26:01,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:01,965 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:01,965 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:01,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:01,966 INFO L82 PathProgramCache]: Analyzing trace with hash -370542859, now seen corresponding path program 44 times [2019-09-03 19:26:01,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:01,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:01,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:01,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:26:01,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:02,736 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:26:02,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:02,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 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:26:02,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:26:02,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:26:02,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:02,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:26:02,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:26:02,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:02,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-03 19:26:02,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:26:02,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:26:02,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:26:02,818 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2019-09-03 19:26:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:02,958 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-09-03 19:26:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:26:02,958 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2019-09-03 19:26:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:02,959 INFO L225 Difference]: With dead ends: 110 [2019-09-03 19:26:02,960 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 19:26:02,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:26:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 19:26:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-03 19:26:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 19:26:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-03 19:26:02,964 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-03 19:26:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:02,964 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-03 19:26:02,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:26:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-03 19:26:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:26:02,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:02,965 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:02,965 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:02,965 INFO L82 PathProgramCache]: Analyzing trace with hash -450123625, now seen corresponding path program 45 times [2019-09-03 19:26:02,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:02,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:02,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:02,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:02,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:03,827 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:26:03,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:03,827 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:26:03,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:26:21,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-03 19:26:21,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:21,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:26:21,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:21,989 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:26:21,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:21,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-03 19:26:21,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:26:21,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:26:21,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:26:21,999 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2019-09-03 19:26:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:22,154 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-09-03 19:26:22,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:26:22,154 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2019-09-03 19:26:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:22,156 INFO L225 Difference]: With dead ends: 112 [2019-09-03 19:26:22,156 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 19:26:22,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:26:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 19:26:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-03 19:26:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 19:26:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-03 19:26:22,160 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-03 19:26:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:22,161 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-03 19:26:22,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:26:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-03 19:26:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:26:22,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:22,162 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:22,162 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:22,162 INFO L82 PathProgramCache]: Analyzing trace with hash 382171577, now seen corresponding path program 46 times [2019-09-03 19:26:22,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:22,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:22,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:22,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:22,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:23,049 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:26:23,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:23,049 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:26:23,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:26:23,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:26:23,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:23,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:26:23,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:23,121 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): Stream closed [2019-09-03 19:26:23,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:23,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-03 19:26:23,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:26:23,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:26:23,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:26:23,126 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2019-09-03 19:26:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:23,282 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-09-03 19:26:23,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:26:23,282 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-03 19:26:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:23,283 INFO L225 Difference]: With dead ends: 114 [2019-09-03 19:26:23,283 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 19:26:23,284 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:26:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 19:26:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-03 19:26:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 19:26:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-03 19:26:23,288 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-03 19:26:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:23,289 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-03 19:26:23,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:26:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-03 19:26:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 19:26:23,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:23,290 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:23,290 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:23,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1353943643, now seen corresponding path program 47 times [2019-09-03 19:26:23,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:23,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:23,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:23,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:23,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:24,300 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:26:24,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:24,301 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:26:24,311 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:26:55,942 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-03 19:26:55,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:55,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:26:55,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:56,013 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:26:56,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:56,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-03 19:26:56,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:26:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:26:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:26:56,030 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2019-09-03 19:26:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:56,172 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-09-03 19:26:56,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:26:56,174 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2019-09-03 19:26:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:56,175 INFO L225 Difference]: With dead ends: 116 [2019-09-03 19:26:56,175 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 19:26:56,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:26:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 19:26:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-03 19:26:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 19:26:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-03 19:26:56,179 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-03 19:26:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:56,179 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-03 19:26:56,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:26:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-03 19:26:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 19:26:56,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:56,180 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:56,181 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:56,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1075971459, now seen corresponding path program 48 times [2019-09-03 19:26:56,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:56,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:56,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:57,097 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:26:57,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:57,097 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:26:57,108 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:28:37,258 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-03 19:28:37,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:37,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:28:37,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:37,328 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:28:37,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:37,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-03 19:28:37,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:28:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:28:37,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:28:37,350 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2019-09-03 19:28:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:37,512 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-09-03 19:28:37,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:28:37,513 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2019-09-03 19:28:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:37,513 INFO L225 Difference]: With dead ends: 118 [2019-09-03 19:28:37,513 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 19:28:37,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:28:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 19:28:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-03 19:28:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 19:28:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-03 19:28:37,520 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-03 19:28:37,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:37,521 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-03 19:28:37,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:28:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-03 19:28:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:28:37,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:37,522 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:37,522 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:37,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:37,523 INFO L82 PathProgramCache]: Analyzing trace with hash 237824543, now seen corresponding path program 49 times [2019-09-03 19:28:37,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:37,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:37,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:37,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:37,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:38,666 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:28:38,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:38,667 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:28:38,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:38,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:28:38,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:38,749 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:28:38,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:38,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-03 19:28:38,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:28:38,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:28:38,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:28:38,754 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2019-09-03 19:28:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:38,935 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-09-03 19:28:38,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:28:38,935 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2019-09-03 19:28:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:38,936 INFO L225 Difference]: With dead ends: 120 [2019-09-03 19:28:38,937 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:28:38,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:28:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:28:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-03 19:28:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:28:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-03 19:28:38,942 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-03 19:28:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:38,942 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-03 19:28:38,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:28:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-03 19:28:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:28:38,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:38,945 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:38,945 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash 75397441, now seen corresponding path program 50 times [2019-09-03 19:28:38,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:38,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:38,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:38,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:40,534 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:28:40,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:40,534 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:28:40,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:28:40,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:28:40,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:40,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:28:40,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:40,662 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:28:40,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:40,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-03 19:28:40,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:28:40,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:28:40,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:28:40,670 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2019-09-03 19:28:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:40,847 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-09-03 19:28:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:28:40,848 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-03 19:28:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:40,849 INFO L225 Difference]: With dead ends: 122 [2019-09-03 19:28:40,849 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 19:28:40,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:28:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 19:28:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-03 19:28:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 19:28:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-03 19:28:40,853 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-03 19:28:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:40,854 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-03 19:28:40,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:28:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-03 19:28:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 19:28:40,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:40,855 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:40,855 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1398224925, now seen corresponding path program 51 times [2019-09-03 19:28:40,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:40,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:40,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:42,076 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:28:42,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:42,076 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:28:42,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:29:12,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-03 19:29:12,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:12,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:29:12,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:12,759 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:29:12,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:12,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-03 19:29:12,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:29:12,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:29:12,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:29:12,771 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2019-09-03 19:29:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:12,924 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-09-03 19:29:12,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:29:12,925 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2019-09-03 19:29:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:12,926 INFO L225 Difference]: With dead ends: 124 [2019-09-03 19:29:12,927 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:29:12,928 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:29:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:29:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-03 19:29:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 19:29:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-03 19:29:12,933 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-03 19:29:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:12,934 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-03 19:29:12,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:29:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-03 19:29:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 19:29:12,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:12,935 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:12,935 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash -210110971, now seen corresponding path program 52 times [2019-09-03 19:29:12,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:12,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:12,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:12,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:12,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:14,040 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:29:14,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:14,041 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:29:14,056 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:29:14,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:29:14,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:14,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:29:14,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:29:14,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:14,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-03 19:29:14,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:29:14,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:29:14,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:29:14,135 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2019-09-03 19:29:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:14,330 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-09-03 19:29:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:29:14,331 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2019-09-03 19:29:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:14,332 INFO L225 Difference]: With dead ends: 126 [2019-09-03 19:29:14,332 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 19:29:14,333 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:29:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 19:29:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-03 19:29:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 19:29:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-03 19:29:14,337 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-03 19:29:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:14,337 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-03 19:29:14,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:29:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-03 19:29:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 19:29:14,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:14,338 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:14,339 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:14,339 INFO L82 PathProgramCache]: Analyzing trace with hash -893901913, now seen corresponding path program 53 times [2019-09-03 19:29:14,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:14,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:14,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:15,440 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:29:15,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:15,441 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:29:15,451 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:29:43,917 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-03 19:29:43,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:43,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:29:43,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:44,000 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:29:44,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:44,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-03 19:29:44,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:29:44,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:29:44,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:29:44,017 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2019-09-03 19:29:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:44,235 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-09-03 19:29:44,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:29:44,235 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-09-03 19:29:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:44,236 INFO L225 Difference]: With dead ends: 128 [2019-09-03 19:29:44,236 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 19:29:44,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:29:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 19:29:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-03 19:29:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 19:29:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-03 19:29:44,241 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-03 19:29:44,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:44,241 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-03 19:29:44,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:29:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-03 19:29:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:29:44,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:44,242 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:44,243 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:44,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:44,243 INFO L82 PathProgramCache]: Analyzing trace with hash -887000887, now seen corresponding path program 54 times [2019-09-03 19:29:44,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:44,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:44,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:45,395 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:29:45,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:45,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 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:29:45,409 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:32:07,301 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-03 19:32:07,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:07,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:32:07,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:07,371 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:32:07,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:07,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-03 19:32:07,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:32:07,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:32:07,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:32:07,396 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2019-09-03 19:32:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:07,547 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-09-03 19:32:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:32:07,547 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2019-09-03 19:32:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:07,549 INFO L225 Difference]: With dead ends: 130 [2019-09-03 19:32:07,549 INFO L226 Difference]: Without dead ends: 124 [2019-09-03 19:32:07,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:32:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-03 19:32:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-03 19:32:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-03 19:32:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-09-03 19:32:07,553 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-09-03 19:32:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:07,553 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-09-03 19:32:07,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:32:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-09-03 19:32:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-03 19:32:07,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:07,554 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:07,555 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:07,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1449917803, now seen corresponding path program 55 times [2019-09-03 19:32:07,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:07,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:07,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:07,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:07,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:08,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:08,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:32:08,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:08,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:32:08,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:08,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-03 19:32:08,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:32:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:32:08,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:32:08,866 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2019-09-03 19:32:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:09,070 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-09-03 19:32:09,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 19:32:09,070 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2019-09-03 19:32:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:09,071 INFO L225 Difference]: With dead ends: 132 [2019-09-03 19:32:09,071 INFO L226 Difference]: Without dead ends: 126 [2019-09-03 19:32:09,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:32:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-03 19:32:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-03 19:32:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-03 19:32:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-09-03 19:32:09,075 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-09-03 19:32:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:09,076 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-09-03 19:32:09,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:32:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-09-03 19:32:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 19:32:09,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:09,078 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:09,078 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash 960883085, now seen corresponding path program 56 times [2019-09-03 19:32:09,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:09,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:09,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:32:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:10,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:10,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:10,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:32:10,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:32:10,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:10,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 19:32:10,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:10,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:10,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-03 19:32:10,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:32:10,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:32:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:32:10,367 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2019-09-03 19:32:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:10,561 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-09-03 19:32:10,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:32:10,561 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2019-09-03 19:32:10,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:10,562 INFO L225 Difference]: With dead ends: 134 [2019-09-03 19:32:10,562 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 19:32:10,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:32:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 19:32:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-03 19:32:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 19:32:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-03 19:32:10,566 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-09-03 19:32:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:10,566 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-03 19:32:10,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:32:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-03 19:32:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 19:32:10,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:10,567 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:10,568 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:10,568 INFO L82 PathProgramCache]: Analyzing trace with hash -850045649, now seen corresponding path program 57 times [2019-09-03 19:32:10,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:10,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:10,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:10,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:10,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:11,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:11,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:11,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:33:02,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-03 19:33:02,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:02,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:33:02,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:02,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:02,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-09-03 19:33:02,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:33:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:33:02,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:33:02,629 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2019-09-03 19:33:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:02,843 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-09-03 19:33:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 19:33:02,844 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2019-09-03 19:33:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:02,845 INFO L225 Difference]: With dead ends: 136 [2019-09-03 19:33:02,845 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 19:33:02,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:33:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 19:33:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-03 19:33:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 19:33:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-09-03 19:33:02,848 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-09-03 19:33:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:02,849 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-09-03 19:33:02,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:33:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-09-03 19:33:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:33:02,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:02,850 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:02,850 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:02,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1690804143, now seen corresponding path program 58 times [2019-09-03 19:33:02,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:02,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:02,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:04,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:04,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:04,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:33:04,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:33:04,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:04,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:33:04,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (59)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:33:04,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:04,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-09-03 19:33:04,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:33:04,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:33:04,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:33:04,319 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 62 states. [2019-09-03 19:33:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:04,541 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-09-03 19:33:04,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 19:33:04,541 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2019-09-03 19:33:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:04,542 INFO L225 Difference]: With dead ends: 138 [2019-09-03 19:33:04,542 INFO L226 Difference]: Without dead ends: 132 [2019-09-03 19:33:04,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:33:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-03 19:33:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-03 19:33:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-03 19:33:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-09-03 19:33:04,547 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-09-03 19:33:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:04,547 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-09-03 19:33:04,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:33:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-09-03 19:33:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 19:33:04,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:04,549 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:04,549 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2089102067, now seen corresponding path program 59 times [2019-09-03 19:33:04,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:04,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:04,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:04,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:04,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:05,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:05,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:05,878 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:33:44,424 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-03 19:33:44,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:44,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 19:33:44,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:44,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:33:44,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-09-03 19:33:44,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:33:44,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:33:44,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:33:44,515 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2019-09-03 19:33:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:44,686 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-09-03 19:33:44,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:33:44,687 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2019-09-03 19:33:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:44,689 INFO L225 Difference]: With dead ends: 140 [2019-09-03 19:33:44,689 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 19:33:44,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:33:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 19:33:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-03 19:33:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-03 19:33:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-09-03 19:33:44,694 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-09-03 19:33:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:44,694 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-09-03 19:33:44,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:33:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-09-03 19:33:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 19:33:44,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:44,695 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:44,695 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:44,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:44,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1036637461, now seen corresponding path program 60 times [2019-09-03 19:33:44,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:44,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:44,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:44,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:44,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:46,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:46,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:33:46,129 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:36:38,046 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-03 19:36:38,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:38,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:36:38,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:38,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:38,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-09-03 19:36:38,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:36:38,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:36:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:36:38,177 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 64 states. [2019-09-03 19:36:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:38,398 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-09-03 19:36:38,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:36:38,399 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 132 [2019-09-03 19:36:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:38,399 INFO L225 Difference]: With dead ends: 142 [2019-09-03 19:36:38,400 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 19:36:38,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:36:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 19:36:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-03 19:36:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 19:36:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-09-03 19:36:38,404 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-09-03 19:36:38,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:38,404 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-09-03 19:36:38,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:36:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-09-03 19:36:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-03 19:36:38,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:38,406 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:38,406 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1064534345, now seen corresponding path program 61 times [2019-09-03 19:36:38,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:38,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:38,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:39,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:39,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:39,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:36:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:39,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 19:36:39,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:39,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:39,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-09-03 19:36:39,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:36:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:36:39,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:36:39,868 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2019-09-03 19:36:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:40,151 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-09-03 19:36:40,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:36:40,151 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2019-09-03 19:36:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:40,153 INFO L225 Difference]: With dead ends: 144 [2019-09-03 19:36:40,153 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 19:36:40,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:36:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 19:36:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-03 19:36:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-03 19:36:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-09-03 19:36:40,159 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-09-03 19:36:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:40,159 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-09-03 19:36:40,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:36:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-09-03 19:36:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:36:40,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:40,161 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:40,161 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1656010791, now seen corresponding path program 62 times [2019-09-03 19:36:40,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:40,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:40,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:40,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:36:40,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:42,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:42,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:36:42,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:42,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:36:42,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:42,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:36:42,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:42,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:42,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-09-03 19:36:42,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:36:42,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:36:42,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:36:42,896 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 66 states. [2019-09-03 19:36:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:43,128 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-09-03 19:36:43,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:36:43,129 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2019-09-03 19:36:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:43,130 INFO L225 Difference]: With dead ends: 146 [2019-09-03 19:36:43,130 INFO L226 Difference]: Without dead ends: 140 [2019-09-03 19:36:43,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:36:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-03 19:36:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-03 19:36:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 19:36:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-09-03 19:36:43,134 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-09-03 19:36:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:43,134 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-09-03 19:36:43,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:36:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-09-03 19:36:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-03 19:36:43,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:43,135 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:43,135 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:43,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1165774971, now seen corresponding path program 63 times [2019-09-03 19:36:43,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:43,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:43,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:43,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:43,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:36:44,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:44,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:44,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:38:06,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-03 19:38:06,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:06,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 19:38:06,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:06,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:06,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-09-03 19:38:06,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:38:06,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:38:06,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:38:06,477 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2019-09-03 19:38:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:06,790 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-09-03 19:38:06,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 19:38:06,790 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2019-09-03 19:38:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:06,792 INFO L225 Difference]: With dead ends: 148 [2019-09-03 19:38:06,792 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 19:38:06,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:38:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 19:38:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-09-03 19:38:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-03 19:38:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-09-03 19:38:06,799 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-09-03 19:38:06,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:06,799 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-09-03 19:38:06,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:38:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-09-03 19:38:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 19:38:06,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:06,802 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:06,802 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1517438819, now seen corresponding path program 64 times [2019-09-03 19:38:06,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:06,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:06,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:06,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:06,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:09,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:09,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:09,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:38:09,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:38:09,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:09,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 19:38:09,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:09,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:09,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-09-03 19:38:09,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:38:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:38:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:38:09,169 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 68 states. [2019-09-03 19:38:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:09,427 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-09-03 19:38:09,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:38:09,427 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 140 [2019-09-03 19:38:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:09,428 INFO L225 Difference]: With dead ends: 150 [2019-09-03 19:38:09,428 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 19:38:09,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:38:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 19:38:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-03 19:38:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 19:38:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-09-03 19:38:09,432 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-09-03 19:38:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:09,433 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-09-03 19:38:09,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:38:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-09-03 19:38:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 19:38:09,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:09,434 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:09,434 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1189453887, now seen corresponding path program 65 times [2019-09-03 19:38:09,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:09,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:09,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:09,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:09,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:38:10,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:10,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:10,990 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1